Modular Arithmetic · Hard problem

Integers $a, b$ satisfy $6a \equiv 6b \pmod{45}$. What is the LARGEST $m$ for which you can conclude $a \equiv b \pmod m$ for every such pair?