A Simple Math Problem（矩阵快速幂）

A Simple Math Problem

Lele now is thinking about a simple function f(x).

If x < 10 f(x) = x.
If x >= 10 f(x) = a0 * f(x-1) + a1 * f(x-2) + a2 * f(x-3) + …… + a9 * f(x-10);
And ai(0<=i<=9) can only be 0 or 1 .

Now, I will give a0 ~ a9 and two positive integers k and m ,and could you help Lele to caculate f(k)%m.
Input
The problem contains mutiple test cases.Please process to the end of file.
In each case, there will be two lines.
In the first line , there are two positive integers k and m. ( k<2*10^9 , m < 10^5 )
In the second line , there are ten integers represent a0 ~ a9.
Output
For each case, output f(k) % m in one line.
Sample Input
10 9999
1 1 1 1 1 1 1 1 1 1
20 500
1 0 1 0 1 0 1 0 1 0
Sample Output
45
104

| F0 F1 F2 F3 F4 F5 F6 F7 F8 F9 |
| 1 0 0 0 0 0 0 0 0 0 |
| 0 1 0 0 0 0 0 0 0 0 | 的n次方乘上
| 0 0 1 0 0 0 0 0 0 0 |
| 0 0 0 1 0 0 0 0 0 0 |
| 0 0 0 0 1 0 0 0 0 0 |
| 0 0 0 0 0 1 0 0 0 0 |
| 0 0 0 0 0 0 1 0 0 0 |
| 0 0 0 0 0 0 0 1 0 0 |
| 0 0 0 0 0 0 0 0 1 0 |

| 1 0 0 0 0 0 0 0 0 0 |
| 0 1 0 0 0 0 0 0 0 0 |
| 0 0 1 0 0 0 0 0 0 0 |
| 0 0 0 1 0 0 0 0 0 0 |
| 0 0 0 0 1 0 0 0 0 0 |
| 0 0 0 0 0 1 0 0 0 0 |
| 0 0 0 0 0 0 1 0 0 0 |
| 0 0 0 0 0 0 0 1 0 0 |
| 0 0 0 0 0 0 0 0 1 0 |
| 0 0 0 0 0 0 0 0 0 1 |
即可得出F(n-1)—F(n-9)

即可求出F(n)

ac代码：

#include<iostream>
#include<algorithm>                                
#include<string.h>
using namespace std;
int mod;
struct node{
   
	int m[15][15];
};
node init,unit;
void vii()