KöMaL 2009 A486

Denote by $\nu$($n$) the exponent of 2 in the prime factorization of $n$!. Show that for arbitrary positive integers $a$ and $m$ there exists an integer $n$>1 for which $\nu(n) \equiv a \pmod{m}$ .