#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
using namespace std;
using namespace __gnu_pbds;
using pii=pair<int,int>;
using ll=long long;
using ull=unsigned long long;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=5010,MOD=1e9+7,B1=32984723,B2=345932;
const char en='\n';
const ll LLINF=1ll<<60;
const int M = 1e6 + 500;

void ad(int&a,int b)
{
	a+=b;
	if (a>=MOD) a-=MOD;
}

int add(int a,int b)
{
	if (a+b>=MOD) return a+b-MOD;
	return a+b;
}

void su(int&a,int b)
{
	a-=b;
	if (a<0) a+=MOD;
}

int sub(int a,int b)
{
	if (a<b) return a-b+MOD;
	return a-b;
}

int mul(int a,int b)
{
	return (a*1ll*b)%MOD;
}

int pot(int n,int k)
{
	if (k==0) return 1;
	int r=pot(n,k/2);
	r=mul(r,r);
	if (k%2) r=mul(r,n);
	return r;
}

using hashtype=unsigned long long;

void dod(hashtype&a,char c)
{
	//a={add(mul(a.x,B1),c),add(mul(a.y,B2),c)};
	a=a*B1+c;
}

const bool DEB=0;
const int ALPH=26;
string re;
ll t,di[N],rr[N],n,k,dp[N],di2[N][N];
hashtype hashdef;
bool bio[N];
gp_hash_table<hashtype,ll> gpp[N];
string v[M];

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	if (DEB) t=1;
	else cin>>t;
	while (t--)
	{
		if (DEB) n=5e3,k=5000;
		else cin>>n>>k;
		vector<string> v(n);
		for(int i = 0;i < n;i++) cin >> v[i];
		cin>>re;
		for (int i=0;i<k;++i) di[i]=LLINF,rr[i]=LLINF,bio[i]=0;
		for (int i = 0;i < n;i++) {	
			di[v[i].size()%k]=min(di[v[i].size()%k],(int)v[i].size()+k);
		}
		rr[0]=0;
		for (int z=0;;++z)
		{
			ll nm=LLINF;
			int kak=-1;
			for (int i=0;i<k;++i) if (!bio[i] && rr[i]<nm)
			{
				nm=rr[i];
				kak=i;
			}
			if (kak==-1) break;
			bio[kak]=1;
			for (int i=kak;i<k;++i) rr[i]=min(rr[i],rr[kak]+di[i-kak]);
			for (int i=0;i<kak;++i) rr[i]=min(rr[i],rr[kak]+di[i+k-kak]);
		}
		int rs=re.size();
		for (int i=0;i<=rs;++i) dp[i]=LLINF;
		for (int i=0;i<rs;++i) for (int j=i;j<rs;++j) di2[i][j]=LLINF;
		vector<hashtype> cu(n),cur(rs);
		set<int> dob;
		for (int i=0;i<n;++i) dob.insert(i);
		for (int le=1;le<=rs;++le)
		{
			vi mak;
			vector<pair<hashtype,ll>> mo;
			for (auto x: dob)
			{
				int xs=v[x].size();
				dod(cu[x],v[x][le-1]);
				int moo=((le-xs)%k+k)%k;
				if (rr[moo]==LLINF) continue;
				ll co=(rr[moo]+xs-le)/k+1;
				//mo.pb({ha.x*1ll*MOD+ha.y,co});
				mo.pb({cu[x],co});
				if (xs==le) mak.pb(x);
			}
			for (auto x: mak) dob.erase(x);
			sort(all(mo));
			reverse(all(mo));
			
			for (int i=0;i<(int)mo.size();++i) gpp[le][mo[i].x]=mo[i].y;
			for (int i=0;i<=rs-le;++i)
			{
				dod(cur[i],re[i+le-1]);
				if (gpp[le].find(cur[i])!=gpp[le].end()) di2[i][i+le-1]=gpp[le][cur[i]];
			}
		}
		/*vector<pair<hashtype,int>> sv;
		sv.reserve(rs*(rs+1)/2);
		for (int i=0;i<rs;++i)
		{
			hashtype ha=hashdef;
			for (int j=i;j<rs;++j)
			{
				dod(ha,re[j]);
				//sv.pb({ha.x*1ll*MOD+ha.y,i*rs+j});
				sv.pb({ha,i*rs+j});
				di2[i][j]=LLINF;
			}
		}
		sort(all(sv));
		int p1=0;
		for (auto x: sv)
		{
			while (p1<(int)mo.size() && mo[p1].x<x.x) ++p1;
			if (p1<(int)mo.size() && mo[p1].x==x.x) di2[x.y/rs][x.y%rs]=mo[p1].y;
		}*/
		dp[0]=0;
		for (int i=0;i<rs;++i)
		{
			for (int j=i;j<rs;++j)
			{
				dp[j+1]=min(dp[j+1],dp[i]+di2[i][j]);
			}
		}
		if (dp[rs]==LLINF) cout<<-1<<en;
		else cout<<dp[rs]<<en;
	}
}