As is well known, the Fibonacci sequence is defined as follows:
It is named after the Italian mathematician Leonardo Fibonacci, also known as Leonardo of Pisa.
Given two integers and , find the greatest common divisor of F_n and F_m.
Each line represents a single test case and contains two integers and m~(1 \le n, m \le 10^{18}). The number of test cases does not exceed .
For each test case, print on a separate line the value of GCD(F_n, F_m) modulo 10^8.
Example 1