Fibonacci Sum
TimeLimit:2000MS MemoryLimit:524288KB
64-bit integer IO format:%I64d
未提交 | 登录后收藏
Problem Description
The Fibonacci numbers are defined as below:
Given three integers N, C and K, calculate the following summation:
Since the answer can be huge, output it modulo 1000000009 ($10^9$+9).
Given three integers N, C and K, calculate the following summation:
Since the answer can be huge, output it modulo 1000000009 ($10^9$+9).
Input
The first line contains an integer T (1≤T≤200), denoting the number of test cases. Each test case contains three space separated integers in the order: N, C, K (1≤N,C≤$10^{18}$,1≤K≤$10^5$).
Output
For each test case, output a single line containing the answer.
SampleInput
2 5 1 1 2 1 2
SampleOutput
12 2