1 #include<iostream>
 2 #include<cstring>
 3 using namespace std;
 4 const int maxn=90,p=2009; 
 5 int tmp[maxn][maxn],bb[maxn][maxn], ans[maxn][maxn];
 6 int id,n,t;
 7 void mul_mat(int a[][maxn],int b[][maxn])
 8 {
 9     memset(tmp,0,sizeof(tmp));
10     for (int i=0;i<id;i++)
11       for (int j=0;j<id;j++)
12         for (int k=0;k<id;k++)
13             tmp[i][j]=(tmp[i][j]+a[i][k]*b[k][j]%p)%p;
14     memcpy(a,tmp,sizeof(tmp));
15 }
16 void ksm()
17 {
18     for (int i=0;i<id;i++)
19        ans[i][i]=1;
20     int tt=t;
21     while (tt)
22     {
23         if (tt&1) mul_mat(ans,bb);
24         mul_mat(bb,bb);
25         tt>>=1;
26     }
27 }
28 int main ()
29 {
30     char c;
31     cin>>n>>t;
32     id=n*9;
33     for (int i=0;i<n;i++)
34     {
35         for (int j=0;j<8;j++)
36             bb[i*9+j][i*9+j+1]=1;
37         for (int j=0;j<n;j++)
38         {
39             cin>>c;
40             c-=‘0‘;
41             if (c) bb[i*9+c-1][j*9]=1;
42         }
43     }
44     ksm();
45     cout<<ans[0][(n-1)*9];
46 }