#include <bits/stdc++.h>
using namespace std;
const int maxk=5005,maxn=1e6+10,inf=0x3f3f3f3f;
int ch[maxn][26],tot,val[maxn],n,K;
vector<int> leaf[maxn];
string s[maxn],T;
vector<int> Len;
bool vis[maxk];
int dis[maxk],dep[maxn];
inline int getpre(int x)
{
    if(~val[x])return val[x];
    val[x]=inf;
    for(int v:leaf[x])
    {
        int len=dep[v]-dep[x];
        val[x]=min(val[x],dis[K-len%K]+(len+K-1)/K+1);
    }
    return val[x];
}
int dp[maxn];
void solve()
{
    cin>>n>>K;
    Len.clear();
    for(int i=1;i<=n;i++)
        cin>>s[i],Len.push_back(s[i].size());
    cin>>T;
    sort(Len.begin(),Len.end());
    Len.resize(unique(Len.begin(),Len.end())-Len.begin());
    memset(dis,0x3f,sizeof dis);
    dis[K]=0;
    dis[0]=0;
    for(int l:Len)
    {
        if(l==0)continue;
        for(int i=0;i<K;i++)vis[i]=0;
        for(int i=0;i<K;i++)
            if(!vis[i])
            {
                vector<int> cy;
                int now=i;
                int z=l%K;
                do{
                    cy.push_back(now);
                    vis[now]=1;
                    now+=z;while(now>=K)now-=K;
                }while(now!=i);
                int len=cy.size();
                for(int i=0;i<len;i++)cy.push_back(cy[i]);
                for(int i=0;i<cy.size()-1;i++)dis[cy[i+1]]=min(dis[cy[i+1]],dis[cy[i]]+(cy[i]+l>=K?(cy[i]+l-cy[i+1])/K+1:1));
            }
    }
    tot=0;memset(ch[0],0,sizeof ch[0]);
    for(int i=1;i<=n;i++)
    {
        int now=0;
        vector<int> path;
        for(int j=0;j<s[i].size();j++)
        {
            int c=s[i][j]-'a';
            if(!ch[now][c])
            {
                ++tot;ch[now][c]=tot;
                dep[tot]=dep[now]+1;
                memset(ch[tot],0,sizeof ch[tot]);
                val[tot]=-1;
                leaf[tot].clear();
            }
            now=ch[now][c];
            path.push_back(now);
        }
        for(int v:path)leaf[v].push_back(now);
    }
    for(int i=1;i<=T.size();i++)dp[i]=inf;
    for(int i=0;i<T.size();i++)
    {
        int now=0;
        for(int j=i;j<T.size();j++)
        {
            int c=T[j]-'a';
            if(!ch[now][c])break;
            now=ch[now][c];
            dp[j+1]=min(dp[j+1],dp[i]+getpre(now));
        }
    }
    if(dp[(int)T.size()]!=inf)printf("%d\n",dp[(int)T.size()]);
    else puts("-1");
}
int main()
{
	//freopen("data.in","r",stdin);
	//freopen("1.out","w",stdout);
    int T;scanf("%d",&T);
    while(T--)solve();
    return 0;
}
/*
1
5 4
cabd
bcca
ddab
dabd
cba
cbc
*/