#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn=5010,MOD=1e9+7;
int n,m,a[maxn][110],ch[maxn][27],val[maxn],size[maxn],sz=0,fail[maxn];
ll L;
char s[110][maxn],S[maxn];
queue<int>Q;
void insert(char *s){int n=strlen(s),u=0;for(int i=0;i<n;i++){int c=s[i]-'a';if(!ch[u][c])ch[u][c]=++sz;u=ch[u][c];}val[u]++;
}
void AC_build(){for(int c=0;c<26;c++)if(ch[0][c])Q.push(ch[0][c]);while(!Q.empty()){int u=Q.front();Q.pop();for(int c=0;c<26;c++)if(ch[u][c]){fail[ch[u][c]]=ch[fail[u]][c];Q.push(ch[u][c]);val[ch[u][c]]|=val[fail[ch[u][c]]];//
        }else ch[u][c]=ch[fail[u]][c];}
}
int M(int x){return x>=MOD?x-MOD:x;}
namespace Task1{int f[maxn][110];void solve(){f[0][0]=1;for(int l=0;l<L;l++){//
            for(int i=0;i<=sz;i++)if(f[i][l]){for(int j=1;j<=n;j++)if(~a[i][j]&&l+size[j]<=L){f[a[i][j]][l+size[j]]=M(f[a[i][j]][l+size[j]]+f[i][l]);}}}int ans=0;for(int i=0;i<=sz;i++)if(f[i][L]&&!val[i])ans=M(ans+f[i][L]);printf("%d",ans);}
}
namespace Task2{const int maxn=110;int N,A[maxn*2][maxn*2],ANS[maxn*2][maxn*2],c[maxn*2][maxn*2];void mul(int a[maxn*2][maxn*2],int b[maxn*2][maxn*2]){for(int i=0;i<=N;i++){for(int j=0;j<=N;j++){c[i][j]=0;for(int k=0;k<=N;k++)c[i][j]=M(c[i][j]+1ll*a[i][k]*b[k][j]%MOD);}}for(int i=0;i<=N;i++)for(int j=0;j<=N;j++)b[i][j]=c[i][j];}void solve(){N=sz*2+1;for(int i=0;i<=sz;i++){for(int j=1;j<=n;j++)if(~a[i][j]){if(size[j]==1)A[a[i][j]*2][i*2]++;else A[a[i][j]*2][i*2+1]++;}A[i*2+1][i*2]=1;}ANS[0][0]=1;while(L){if(L&1)mul(A,ANS);mul(A,A);L>>=1;}int ans=0;for(int i=0;i<=sz;i++)if(!val[i])ans=M(ans+ANS[i*2][0]);printf("%d",ans);}
}
int main(){scanf("%d%d%lld",&n,&m,&L);for(int i=1;i<=n;i++)scanf("%s",s[i]);for(int i=1;i<=m;i++){scanf("%s",S);insert(S);}AC_build();memset(a,-1,sizeof(a));for(int k=1;k<=n;k++){size[k]=strlen(s[k]);for(int i=0;i<=sz;i++){int u=i;for(int j=0;j<size[k];j++)if(!val[u])u=ch[u][s[k][j]-'a'];else break;if(!val[u])a[i][k]=u;}}if(L<=100)Task1::solve();elseTask2::solve();return 0;
}