#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e6+5,M=5e3+5,K=14348907+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
int Le,n,m,k,l[N],r[N];char s[N],t[M];ll dp[M],f[M],g[M];
namespace Trie{
	int son[N][26],Ct;ll ff[N];
	void Cl(){for(int i=1;i<=Ct;i++) Me(son[i],0),ff[i]=0;Ct=1;}
	void Ins(char *c,int Le){
		int x=1;
		for(int i=0;i<Le;i++) {
			c[i]-='a';if(!son[x][c[i]]) son[x][c[i]]=++Ct,ff[Ct]=INF;x=son[x][c[i]];
			ff[x]=min(ff[x],f[(Le-i-1)%k]+(Le-i-1)/k);
		}
	}
}
void Solve(){
	int i,j,h;
	scanf("%d%d",&n,&k);Me(g,0x3f);Trie::Cl();
	l[0]=1;for(i=1;i<=n;i++){
		l[i]=l[i-1]+r[i-1];scanf("%s",s+l[i]);r[i]=strlen(s+l[i]);
		g[r[i]%k]=min(g[r[i]%k],r[i]/k+1ll);
		// cerr<<l[i]<<' '<<r[i]<<'\n';
	} 
	Me(f,0x3f);f[0]=0;
	for(i=1;i<k;i++)if(g[i]<1e9){
		int G=__gcd(k-i,k);
		int CC=0;
		for(j=0;j<G;j++) {
			for(int h=j,c=0;c<2;c+=(h==j)){
				int p=(h+k-i)%k;
				f[p]=min(f[p],f[h]+g[i]+(p>h));h=p;
				CC++;
			}
		}
		assert(CC==k/G*2);
		/*for(j=0;j<G;j++) {
			for(h=0;h<k/G*2;h++) f[((h+1)*(k-i)+j)%k]=min(f[((h+1)*(k-i)+j)%k],f[(h*(k-i)+j)%k]+g[i]+(((h+1)*(k-i)+j)%k>(h*(k-i)+j)%k));
		}*/
	}
	for(i=1;i<=n;i++) Trie::Ins(s+l[i],r[i]);
	scanf("%s",t+1);m=strlen(t+1);for(i=1;i<=m;i++) t[i]-='a';
	Me(dp,0x3f);dp[0]=0;
	for(i=0;i<m;i++){
		int x=1;
		for(j=i+1;j<=m;j++) if(Trie::son[x][t[j]]){
			x=Trie::son[x][t[j]];
			dp[j]=min(dp[j],dp[i]+Trie::ff[x]+1);
		}else break;
	}
	printf("%lld\n",dp[m]>=1e18?-1ll:dp[m]);
}
int main(){
	int t;
	scanf("%d",&t);
	// t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}