Given the modulus m and the two seeds x0, x1, with 0 < x0,x1 < m, a sequence of pseudorandom numbers can be generated recursively from xn = (xn-1 + xn-2) mod m, n > 2. This generator is called the Fibonacci generator.
Find the first ten pseudorandom numbers generated when m = 37 and x0 = 1, x1 = 28.