#include<bits/stdc++.h>
using namespace std;
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
#define rep(i,j,k) for(int i=j;i<=k;++i)
#define per(i,j,k) for(int i=j;i>=k;--i)
#define ll long long
#define vi vector<int>
#define db double
const ll mod=1231453023109121,INF=1e18;
const int N=5005,bs=131,M=1e6+6;
void Min(ll &x,ll y){x=min(x,y);}
unordered_map<ll,vi>mp;
unordered_map<ll,ll>res;
char s[M];
ll l[N],dis[N],dp[N][N],ans[N];
string S[M]; int q[N];
void slv(){
    int n,k;cin>>n>>k;
    mp.clear(); res.clear();
    rep(i,0,k)l[i]=INF;
    rep(i,1,n){
        cin>>s+1;
        int len=strlen(s+1); ll v=0;
        rep(j,1,len){
            v=(bs*v+s[j])%mod; mp[v].push_back(len-j);
        }
        Min(l[len%k],k+len);
    }
    int top=0;
    rep(i,0,k-1){
        if(l[i]!=INF)q[++top]=i;
    }
    dis[0]=0; rep(i,1,k-1)dis[i]=INF;
    vi vis(k+1);
    while(1){
        ll mi=INF; int x;
        rep(i,0,k-1){
            if(!vis[i] && dis[i]<mi){
                mi=dis[i]; x=i;
            }
        }
        if(mi==INF)break; vis[x]=1;
        for(int j=1;j<=top;++j){
            int i=q[j];
            Min(dis[(x+i)%k],dis[x]+l[i]);
        }
    }
    for(auto &[key,vec]:mp){
        ll val=INF;
        for(auto len:vec){
            int x=((-len)%k+k)%k;
            if(dis[x]<INF)Min(val,(dis[x]+len)/k+1);
        }
        res[key]=val;
    }
    cin>>s+1; int m=strlen(s+1); //下次用n吧..
    rep(l,1,m){
        ll v=0;
        rep(r,l,m){
            dp[l][r]=INF;
            v=(v*bs+s[r])%mod; //忘%mod了
            if(mp.count(v))dp[l][r]=res[v];
        }
    }
    rep(i,1,m){
        ans[i]=dp[1][i];
        rep(j,1,i-1)Min(ans[i], ans[j]+dp[j+1][i]);
    }
    cout<<(ans[m]>=INF?-1:ans[m])<<'\n';
}
signed main(){
    IOS
    int T;cin>>T;
    while(T--)slv();
}
/*
1
2 3
defgh
abc
abcde
*/