Let m be a positive integer, and let f(X, Y) = aoXn + a1Xn(-1)Y + ... + anYn ∈z[X,Y] be an irreducible binary form of degree n witn n≥3.In this paper we prove that if gcd(m, a0)=1,n≥400 and m≥10(35),then the equation |f(x,y)|= m has at most 6nv(m)integer solutions(x, y) with gcd (x, y) =1,where v(m)is the number of solutions of the congruence F(z) = f(z, 1) ≡ 0(modm). Moreover, if gcd(m,DF) = 1, Where DF is the discriminant of F, then the equation has at most 6n(ω(m)+1) solutions(x,y), where ω(m)is the number of distinct prime factors of m.