Colossal Fibonacci Numbers! The i’th Fibonacci number f(i) is recur-

sively defined in the following way: • f(0)=0andf(1)=1 • f(i+2)=f(i+1)+f(i)forevery i≥0 Your task is to compute some values of this sequence. Input Input begins with an integer t ≤ 10, 000, the number of test cases. Each test case consists of three integers a, b, n where 0≤a,b<264 (aandbwillnotbothbe zero) and 1 ≤ n ≤ 1000. Output Oooh...pretty For each test case, output a single line containing the remainder of f(ab) upon division by n. Sample Input 3 112 2 3 1000 18446744073709551615 18446744073709551615 1000 Sample Output 1 21 250