class Fibonacci { int tmp[2][2], now[2][2]; inline int addmul(int a, int m0, int m1) { return (a + (long long) m0 * m1) % 1000000007; } void mul(int C[][2], int A[][2], int dime) { int i, j, k; memcpy(tmp, C, sizeof (tmp)); ...