#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
int tot1=0,tot2=0;
pair<int,int> d1[1005];
map<int,int> mp1[1005];
pair<int,int> d2[1005];
map<int,int> mp2[1005];
string s[1005];
#define ull unsigned long long
ull pw[1005];
vector<ull> hsh1[1005];
vector<ull> hsh2[1005];
int f[1005][1005];
bool ok1[1005][1005];
int g[1005][1005];
bool ok2[1005][1005];
int n,l;
ull get1(int id,int l,int r){
	if(l>r)return 0;
	return hsh1[id][r]-(l==0?0:hsh1[id][l-1])*pw[r-l+1];
}
ull get2(int id,int l,int r){
	if(l>r)return 0;
	return hsh2[id][l]-(r==(int)s[id].size()-1?0:hsh2[id][r+1])*pw[r-l+1];
}
int dp1(int L,int sta);
int dp2(int L,int sta);
int dp1(int L,int sta){
	if(ok1[L][sta])return f[L][sta];
	ok1[L][sta]=1;
    int id=d1[sta].first;
    int len=d1[sta].second;
    if((int)s[id].size()-len>L)return f[L][sta]=0;
    if((int)s[id].size()-len==L)return f[L][sta]=(get1(id,len,(int)s[id].size()-1)==get2(id,len,(int)s[id].size()-1)?1:0);
    int res=s[id].size()-len;
    for(int i=1;i<=n;i++){
        if(res<(int)s[i].size()){
			if(get1(id,len,(int)s[id].size()-1)==get2(i,(int)s[i].size()-res,(int)s[i].size()-1))f[L][sta]=(f[L][sta]+dp2(L-2*res,mp2[i][(int)s[i].size()-res-1]))%mod;
		}else{
			if(get1(id,len,len+(int)s[i].size()-1)==get2(i,0,(int)s[i].size()-1))f[L][sta]=(f[L][sta]+dp1(L-2*(int)s[i].size(),mp1[id][len+(int)s[i].size()]))%mod;
		}
	}
	return f[L][sta];
}
int dp2(int L,int sta){
	if(ok2[L][sta])return g[L][sta];
	ok2[L][sta]=1;
	int id=d2[sta].first;
	int len=d2[sta].second;
	if(len+1>L)return g[L][sta]=0;
	if(len+1==L)return g[L][sta]=(get1(id,0,len)==get2(id,0,len)?1:0);
	int res=len+1;
	for(int i=1;i<=n;i++){
	    if(res<(int)s[i].size()){
			if(get1(id,0,len)==get2(i,0,res-1))g[L][sta]=(g[L][sta]+dp1(L-2*res,mp1[i][res]))%mod;
		}else{
			if(get1(id,len-(int)s[i].size()+1,len)==get2(i,0,(int)s[i].size()-1))g[L][sta]=(g[L][sta]+dp2(L-2*(int)s[i].size(),mp2[id][len-(int)s[i].size()]))%mod;
		}
	}
	return g[L][sta];
}
signed main(){
    cin>>n>>l;
    pw[0]=1;
    for(int i=1;i<=1000;i++)pw[i]=pw[i-1]*137;
    for(int i=1;i<=n;i++){
		cin>>s[i];
		hsh1[i].resize(s[i].size());
		hsh2[i].resize(s[i].size());
		for(int j=0;j<(int)s[i].size();j++){
		    tot1++;d1[tot1]={i,j};mp1[i][j]=tot1;
		    hsh1[i][j]=(j==0?0:hsh1[i][j-1])*137+s[i][j];
		}
		tot1++;d1[tot1]={i,(int)s[i].size()};mp1[i][(int)s[i].size()]=tot1;
		for(int j=(int)s[i].size()-1;j>=0;j--){
			tot2++;d2[tot2]={i,j};mp2[i][j]=tot2;
			hsh2[i][j]=(j==(int)s[i].size()-1?0:hsh2[i][j+1])*137+s[i][j];
		}
		tot2++;d2[tot2]={i,-1};mp2[i][-1]=tot2;
	}
	cout<<dp1(l,mp1[1][(int)s[1].size()])<<endl;
	return 0;
}