#include<bits/stdc++.h>
using namespace std;
const int N=1e6,MK=5000;
const long long INF=1e18;
int Q,n,K,m,len[N+10],c[N+10][26],vis[N+10][26],cnt,TIM,tmp;
long long mn[MK+10],g[MK+10],cst[N+10],dp[MK+10];
string s[N+10];
char T[MK+10];
void Ins(int x,int id,int nw){
	//cout<<"INS "<<x<<" "<<id<<","<<nw<<"\n";
	cst[x]=min(cst[x],g[K-(len[id]-nw)%K]+1+1+(len[id]-nw)/K);
	//cout<<"CST="<<cst[x]<<"\n";
	if(nw==len[id])return;
	int t=s[id][nw]-'a';
	if(vis[x][t]!=TIM)vis[x][t]=TIM,c[x][t]=++cnt,cst[cnt]=INF;
	Ins(c[x][t],id,nw+1);
}
int main(){
	scanf("%d",&Q);
	while(Q--){
		scanf("%d%d",&n,&K);
		for(int i=1;i<K;++i)mn[i]=g[i]=INF;
		for(int i=1;i<=n;++i){
			cin>>s[i],len[i]=s[i].size();
			mn[len[i]%K]=min(mn[len[i]%K],1ll+len[i]/K);
		}
		for(int i=1;i<K;++i)if(mn[i]<INF)for(int j=2,l=(i<<1)%K;j<K;++j){
			mn[l]=min(mn[l],mn[i]*j);
			if(mn[i]*j>INF)break;
			(l+=i)>=K?l-=K:0;
		}
		g[K]=-1;
		for(int i=1;i<K;++i)for(int j=0,t=i;j<K;++j,((++t)==K?t=0:0)){
			g[t]=min(g[t],g[j]+mn[i]);
		}
		//for(int i=0;i<K;++i)cout<<"G "<<i<<"="<<g[i]<<"\n";
		cnt=1,++TIM;
		for(int i=1;i<=n;++i)Ins(1,i,0);
		scanf("%s",T+1),m=strlen(T+1);
		for(int i=1;i<=m;++i)dp[i]=INF;
		for(int i=0;i<m;++i)if(dp[i]!=INF){
			tmp=1;
			//cout<<"DP "<<i<<"="<<dp[i]<<"\n";
			for(int j=i+1;j<=m;++j){
				if(vis[tmp][T[j]-'a']!=TIM)break;
				tmp=c[tmp][T[j]-'a'];
				dp[j]=min(dp[j],dp[i]+cst[tmp]);
			}
		}
		printf("%lld\n",dp[m]==INF?-1ll:dp[m]);
	}
	return 0;
}
/*
2
2 3
defgh
abc
abcde
1 1
a
b
*/