#include <iostream>
#include <stdio.h>
#include <cstring>
using namespace std;
#define FF(i,a) for( int i = 0 ; i < a ; i ++ )
#define CC(m,what) memset(m,what,sizeof(m))
typedef long long ll;
const int NODE = 110;
const int MAXN = 101;
const int MOD = 100000;
const int CH = 4;
int chd[NODE][CH] , cnt;//结点个数
int word[NODE];//关键数组,记录每个单词尾结点的信息,每道题目都不一样
int fail[NODE];//传说中的失败指针
int Que[NODE];//辅助队列
int sw[128];//string swap每个字符对应的Index,方便模板化
void Ins(char *a, int val) {
int p = 0;
for(; *a ; a ++) {
int c = sw[*a];
if(!chd[p][c]) {
//CC(chd[cnt] , 0);
memset( chd[cnt], 0, sizeof( chd[cnt] ));
word[cnt] = 0;
chd[p][c] = cnt ++;
}
p = chd[p][c];
}
word[p] = val;
}
void AC() {
int *s = Que , *e = Que;
for ( int i = 0; i < CH; i++ )
if(chd[0][i]) {
fail[chd[0][i]] = 0;
*e++ = chd[0][i];
}
while(s != e) {
int p = *s++;
for ( int i = 0 ; i < CH; i ++ ) {
if( chd[p][i] ) {
int v = chd[p][i];
*e++ = v;
fail[v] = chd[fail[p]][i];
//word[v] += word[fail[v]];
//对word[v]按word[fail[v]]里的内容进行处理
} else {
chd[p][i] = chd[fail[p]][i];
}
}
}
}
void init ()
{
fail[0] = 0;
sw['A'] = 0;
sw['C'] = 1;
sw['G'] = 2;
sw['T'] = 3;
//下面两句每次都必须初始化
//CC(chd[0],0);
memset( chd[0], 0,sizeof( chd[0] ));
//memset ( word, 0 , sizeof ( word ));
cnt = 1;
}
int Mat_Size;
struct mat
{
ll w[MAXN][MAXN];
mat(){memset ( w, 0, sizeof ( w ));}
mat operator*( mat t )
{
mat ans;
for ( int i = 0; i < Mat_Size; i++ )
for ( int j = 0; j < Mat_Size; j++ )
{
for ( int k = 0; k < Mat_Size; k++ )
ans.w[i][j] += (w[i][k]%MOD*t.w[k][j]%MOD)%MOD;
ans.w[i][j] %= MOD;
}
return ans;
}
mat operator^( int m )
{
mat ans , temp;
for ( int i = 0; i < Mat_Size; i ++ )
ans.w[i][i] = 1;
for ( int i = 0; i < Mat_Size; i ++ )
for ( int j = 0; j < Mat_Size; j ++ )
temp.w[i][j] = w[i][j];
while ( m )
{
if ( m&1 )
ans = ans*temp;
temp = temp*temp;
m /= 2;
}
return ans;
}
};
//AC()函数处理后 chd[p][i] 就是在p结点进行i转移到达的结点
int main()
{
int n , m;
char c[20][100];
while ( scanf("%d%d" ,&n ,&m ) != EOF )
{
//memset ( _mat , 0 , sizeof ( _mat ));
//memset ( ans , 0 , sizeof ( ans ));
mat ans , _mat;
init();
for ( int i = 0 ; i < n; i ++ )
{
scanf("%s" , c[i] );
}
for ( int i = 0 ; i < n; i ++ )
{
int flag = 0;
for ( int j = 0; j < n; j ++ )
{
if ( strstr( c[i], c[j] ) && strcmp ( c[i] , c[j] ) )
flag = 1;
}
if ( !flag )
Ins( c[i] , 1 );
}
AC();
Mat_Size = cnt;
for ( int i = 0 ; i < cnt ; i ++ )
for ( int j = 0 ; j < CH; j ++ )
if ( !word[i] )
{
int temp;
//cout << temp << endl;
temp = chd[i][j];
if ( !word[temp] )
_mat.w[i][temp]++;
}
//cout << "here" << endl;
// for ( int i = 0 ; i < cnt ; i ++ )
// {
// for ( int j = 0 ; j < cnt ; j ++ )
// cout << _mat.w[i][j] << " " ;
// cout << endl;
// }
ans = _mat^m;
ll total = 0;
// for ( int i = 0 ; i < cnt ; i ++ )
// {
// for ( int j = 0 ; j < cnt ; j ++ )
// cout << _mat[i][j] << " " ;
// cout << endl;
// }
for ( int i = 0 ; i < cnt ; i ++ )
{
total += ans.w[0][i]%MOD;
total %= MOD;
}
// for ( int i = 0 ; i < cnt ; i ++ )
// {
// for ( int j = 0 ; j < cnt ; j ++ )
// cout << ans[i][j] << " " ;
// cout << endl;
// }
printf("%lld\n" , total%MOD);
}
return 0;
}
/*
4 4
AT
AC
AG
AA
2 2
C
A
*/