#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <queue>
#include <cstring>
#include <algorithm>
#define LL long long//***
using namespace std;
const int N = 110;
const int mod = 100000;
int n,m,ncnt;
char ill[15];struct node{int id;bool flag;node *ch[4],*fail;void init(){flag = false;for(int i = 0;i < 4;++i)ch[i] = NULL;}
}trie[N*N];
int hash[128];//***
struct Matrix{LL map[N][N];void clear(){memset(map,0,sizeof(map));}
}c;node *newnode(){node *p = &trie[ncnt];p->init(); p->id = ncnt++;return p;
}void insert(node *root,char *s){node *p = root;while(*s != '\0'){if(p->ch[hash[*s]])p = p->ch[hash[*s]];else {p->ch[hash[*s]] = newnode();p = p->ch[hash[*s]];}++s;}p->flag = true;
}void Build(node *root){queue <node *> q;q.push(root);while(!q.empty()){node *p = q.front();q.pop();for(int i=0;i<4;++i){if(p->ch[i]){node *next = p->fail;while(next && !next->ch[i])next = next->fail;p->ch[i]->fail = next ? next->ch[i]:root;if(p->ch[i]->fail->flag)p->ch[i]->flag=true;//***q.push(p->ch[i]);}else p->ch[i] = (p == root) ? root:p->fail->ch[i];if(!p->ch[i]->flag)++c.map[p->id][p->ch[i]->id];}  }
}Matrix Matrix_mul(Matrix x,Matrix y){Matrix res;res.clear();for(int i = 0;i < ncnt;++i){for(int j = 0;j < ncnt;++j){for(int k = 0;k < ncnt;++k){res.map[i][j] = (res.map[i][j]+y.map[i][k]*x.map[k][j])%mod;}}}return res;
}Matrix Pow(Matrix x,int n){Matrix res;res.clear();for(int i = 0;i < ncnt;++i)res.map[i][i] = 1;while(n){if(n&1)res = Matrix_mul(res,x);x = Matrix_mul(x,x);n >>=1;}return res;
}void _fre(node *p){for(int i = 0;i < 4;++i){if(p->ch[i])_fre(p->ch[i]);}free(p);
}int main(){hash['A'] = 0,hash['C'] = 1,hash['G'] = 2,hash['T'] = 3;while(scanf("%d%d",&m,&n) != EOF){ncnt = 0;c.clear();memset(trie,0,sizeof(trie));node *root = newnode();for(int i = 0;i < m;++i){scanf("%s",ill);insert(root,ill);}Build(root);Matrix res = Pow(c,n);LL ans = 0;for(int i = 0;i < ncnt;++i){ans += res.map[0][i];ans %= mod;}cout<<ans<<endl;// _fre(root);莫名RE }return 0;
}