Let c be any integer.
Prove that if $k$ and $l$ are coprime positive integers, then the linear Diophantine equation $kx-ly=c$ has infinitely many positive integer solutions
To start off, I know that a positive integer solution is a pair $(x,y) \in \mathbb N \times \mathbb N$ such that $kx-ly=c$. But I am not sure how I can use this to prove the statement.
Any help is appreciated. :)