Challenge: Huge Fibonacci Number

Problem

---

Huge Fibonacci Number Problem

Compute the $n$-th Fibonacci number modulo $m$.

Input: Integers $n$ and $m$.

Output: The $n$-th Fibonacci number modulo $m$.