9. Another way to generate pseudo-random numbers is to use the Fibonacci generator. Let $m$ be a positive integer. Two initial integers $x_{0}$ and $x_{1}$ less than $m$ are specified and the rest of the sequence is generated recursively by the congruence $x_{n+1} \equiv x_{n}+x_{n-1}(\bmod m), \quad 0 \leqslant x_{n+1}<m$.

Find the first eight pseudo-random numbers generated by the Fibonacci generator with modulus $m=31$ and initial values $x_{0}=1$ and $x_{1}=24$.
9. $1,24,25,18,12,30,11,10$