#include<cstdio>

#include<cstring>

#include<algorithm>

#include<cctype>

#include<cstdlib>

#define maxn 105

#define mod 2009

using namespace std;

inline long long read(){

    long long num=,f=;

    char ch=getchar();

    while(!isdigit(ch)){

        if(ch=='-')    f=-;

        ch=getchar();

    }

    while(isdigit(ch)){

        num=num*+ch-'';

        ch=getchar();

    }

    return num*f;

}

int lim;

struct Matrix{

    long long s[maxn][maxn];

    void clear(){memset(s,,sizeof(s));    }

};

Matrix operator *(Matrix a,Matrix b){

    Matrix ans;    ans.clear();

    for(int i=;i<=lim;++i)

        for(int j=;j<=lim;++j)

            for(int k=;k<=lim;++k)    ans.s[i][j]=(ans.s[i][j]+a.s[i][k]*b.s[k][j]%mod)%mod;

    return ans;

}

Matrix Pow(Matrix a,long long b){

    Matrix ret;    ret.clear();

    for(int i=;i<=maxn;++i)    ret.s[i][i]=;

    while(b){

        if(b&)    ret=ret*a;

        a=a*a;

        b>>=;

    }

    return ret;

}

int n;

int calc(int a,int b){    return a+(b-)*n;    }

char c[maxn];

int main(){

    Matrix sta;    sta.clear();

    n=read();long long t=read();lim=n*;

    for(int i=;i<=n;++i){

        for(int j=;j<;++j)    sta.s[calc(i,j)][calc(i,j+)]++;

        scanf("%s",c+);

        for(int j=;j<=n;++j){

            int x=c[j]-'';

            if(x==)    continue;

            for(int k=;k+x-<=;++k)    sta.s[calc(i,x+k-)][calc(j,+k-)]++;

        }

    }

    sta=Pow(sta,t);

    //for(int i=1;i<=lim;++i,printf("\n"))

//        for(int j=1;j<=lim;++j)    printf("%lld ",sta.s[i][j]);

    printf("%lld",sta.s[][n]);

    return ;

}