#include <bits/stdc++.h>
using namespace std;
const int inf=1e9;
string s[1000010];
char t[5010];
int len[1000010],f[1000010],now,tot,nxt[1000010][30],cost[1000010];
void insert(int id){
    int n=s[id].size()-1,now=0;
    for(int i=1;i<=n;i++){
        int ch=s[id][i]-'a'+1;
        if(!nxt[now][ch])nxt[now][ch]=++tot;
        now=nxt[now][ch];
        cost[now]=min(cost[now],f[n-i]);
    }
}
int dp[5010];
void solve(){
    int n,K,m=0;
    for(int i=1;i<=tot;cost[i]=inf,++i)for(int j=1;j<=26;j++)nxt[i][j]=0;
    memset(cost,0x3f,sizeof(cost));
    tot=0;
    scanf("%d%d",&n,&K);
    for(int i=1;i<=n;i++){
        cin>>s[i];s[i]=" "+s[i];
        len[++m]=s[i].size()-1;
    }
    sort(len+1,len+1+m);m=unique(len+1,len+1+m)-len-1;
    queue<int>q;q.push(0);
    for(int i=1;i<=len[m]+K;i++)f[i]=inf;
    f[0]=1;
    while(!q.empty()){
        int x=q.front();q.pop();
        // cout<<x<<" "<<f[x]<<"\n";
        //a>=k
        if(x+K<=len[m]+K&&f[x+K]==inf)f[x+K]=f[x]+1,q.push(x+K);
        //a<k
        int p=lower_bound(len+1,len+1+m,x)-len-1;
        for(int i=p;i>=1&&x-len[i]<K;i--)if(f[x-len[i]]==inf){
            f[x-len[i]]=f[x]+1;q.push(x-len[i]);
        }
    }
    for(int i=1;i<=n;i++)insert(i);
    scanf("%s",t+1);
    m=strlen(t+1);
    for(int i=1;i<=m;i++)dp[i]=inf;dp[0]=0;
    for(int i=0;i<m;i++)if(dp[i]!=inf){
        int now=0;
        for(int j=i+1;j<=m;j++){
            int ch=t[j]-'a'+1;
            if(!nxt[now][ch])break;
            now=nxt[now][ch];
            dp[j]=min(dp[j],dp[i]+cost[now]);
        }
    }
    if(dp[m]==inf)printf("-1\n");
    else printf("%d\n",dp[m]);
}
int main() {
    for(int i=1;i<=1e6;i++)cost[i]=inf;
    int t;scanf("%d",&t);
    while(t--)solve();
    return 0;
}