Problem - Power Modulo

Compute $x^n \bmod m$ where $x, n, m$ can be up to $10^9$.

For example, $2^{10} \bmod 1000 = 1024 \bmod 1000 = 24$.

You'll use exponentiation by squaring, but take the modulo after every multiplication to keep intermediate results small.