Cipher

Limak is breaking into the Compute-Anything System. Its security relies on an extremely strong password scheme that Limak has already cracked. The scheme works as follows: the computer gives a pair of numbers $n$, $m$, and the intruder must very quickly report the last digits of the consecutive Fibonacci numbers from $fib(n)$ up to $fib(m)$. The Fibonacci numbers are defined by $fib(1) = 1$, $fib(2) = 1$, and $fib(n) = fib(n-1) + fib(n-2)$ for $n > 2$. The first two terms are both 1, and each following term is the sum of the two preceding ones, so the sequence begins $1, 1, 2, 3, 5, 8, 13, \dots$. Write a program that helps Limak.

The first and only line contains two natural numbers $n$, $m$ ($0 < n < m < 10^7$), separated by a single space.

In the first and only line, output the last (least significant) digit of each Fibonacci number from $fib(n)$ up to $fib(m)$, concatenated in order. The digits must not be separated by any characters.