#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;
#define M 11
#define LEN 15
#define SIZE (M*LEN)
#define mod 100000typedef __int64 LL;int next[M*LEN][4];
int fail[M*LEN];
bool isend[M*LEN];
int m,n,node;
LL mat[M*LEN][M*LEN];
LL tmp[M*LEN][M*LEN];
LL ans[M*LEN][M*LEN];
void init()
{node=1;memset(next[0],0,sizeof(next[0]));
}
void add(int cur,int k)
{memset(next[node],0,sizeof(next[node]));isend[node]=0;next[cur][k]=node++;
}
int hash(char c)
{switch(c){case 'A':   return 0;case 'C':   return 1;case 'T':   return 2;case 'G':   return 3;}
}
void insert(char *s)
{int i,k,cur;for(i=cur=0;s[i];i++){k=hash(s[i]);if(!next[cur][k])   add(cur,k);cur=next[cur][k];}isend[cur]=1;
}
void build_ac()
{queue<int>q;int cur,nxt,tmp;fail[0]=0;q.push(0);while(!q.empty()){cur=q.front(),q.pop();for(int k=0;k<4;k++){nxt=next[cur][k];if(nxt){if(cur==0)  fail[nxt]=0;else{for(tmp=fail[cur];tmp && !next[tmp][k];tmp=next[tmp][k]);fail[nxt]=next[tmp][k];}if(isend[fail[nxt]]) isend[nxt]=1;q.push(nxt);}else{next[cur][k]=next[fail[cur]][k];}}}
}
void build_mat()
{int cur,nxt,k;memset(mat,0,sizeof(mat));for(cur=0;cur<node;cur++){if(isend[cur])  continue;for(k=0;k<4;k++){nxt=next[cur][k];if(!isend[nxt])  mat[cur][nxt]++;}}
}
void mat_mul(LL a[][SIZE],LL b[][SIZE])
{for(int i=0;i<node;i++){for(int j=0;j<node;j++){tmp[i][j]=0;for(int k=0;k<node;k++){tmp[i][j]+=a[i][k]*b[k][j];}tmp[i][j]%=mod;}}
}
void mat_pow(int k)
{memset(ans,0,sizeof(ans));for(int i=0;i<node;i++) ans[i][i]=1;while(k){if(k&1){mat_mul(ans,mat);memcpy(ans,tmp,sizeof(tmp));}k>>=1;mat_mul(mat,mat);memcpy(mat,tmp,sizeof(tmp));}
}
void solve()
{build_ac();build_mat();mat_pow(n);LL ret=0;for(int i=0;i<node;i++) ret+=ans[0][i];printf("%I64d\n",ret%mod);
}
int main()
{char s[LEN];while(~scanf("%d%d",&m,&n)){init();for(int i=0;i<m;i++){scanf("%s",s);insert(s);}solve();}return 0;
}