proof writing - How to prove that $gcd(a,m) le gcd(a,mn)$ for any integer n

I'm trying to show that $\gcd(a,m) \le \gcd(a,mn)$ for any integer n

Taking a classical algebra course and can not seem to figure out how to prove this. I know about Bezout's Identity but don't know how I could apply it to this problem.