let f: S --> T be a surjective function

if S is countable, prove that T is countable

I see that f(S) = T, but and I know that there is a surjection from the natural numbers to S, and an injection from S to N, but I'm not really sure where to head to show that T is countable...Please help