Modular Arithmetic · Medium problem

A student claims: "for every modulus $m \ge 2$, every perfect square is $\equiv 0$ or $1 \pmod m$." What is the smallest $m$ for which the claim is FALSE?