#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<cstring>
using namespace std;
int read()
{
	char ch;
	int x,f=1;
	while(ch=getchar(),!isdigit(ch))if(ch=='-')f=-1;
	x=ch-48;
	while(ch=getchar(),isdigit(ch))x=x*10+ch-48;
	return x*f;
}
struct node
{
	string s;
	int num;
}z[7];
int f[300][300];int b[210];
char ch[210];
void innt()
{
	memset(b,0,sizeof(b));
	int n=read(),k=read();
	string s1,s2;
	for(int i=1;i<=n;i++)
	{
		cin>>s2;
		s1=s1+s2;
	}
	int p=read();
	for(int i=1;i<=p;i++)
	{
		cin>>z[i].s;
	}
	int len=s1.size();
	for(int i=0;i<len;i++)
	{
		for(int j=1;j<=p;j++)
		{
			int chang=z[j].s.size();
			string s3=s1.substr(i,chang);//cout<<s3<<' '<<z[j].s<<endl;
			if(s3==z[j].s)
			{
				if(!b[i+1]||b[i+1]>chang+i)
				b[i+1]=i+chang;
				
			}
		}
	}
	for(int i=1;i<=n*20;i++)
	{
		for(int l=1;l<=min(k,i);l++)
		{
			for(int j=l;j<i;j++)
			{
					int sum=0;
					for(int k=j;k<=i;k++)
					{
						if(b[k]<=i&&b[k])sum++;//cout<<b[k]<<' '<<sum<<endl;
					}
					f[i][l]=max(f[i][l],f[j][l-1]+sum);//cout<<f[j][l-1]<<endl;
			}
		}
	}
	printf("%d",f[n*20][k]);
}
int init()
{
	freopen("tjdcgs.in","r",stdin);
	freopen("tjdcgs.out","w",stdout);
	int t=read();
	while(t--)
	{
		innt();
	}
	return 0;
}
int you=init();
int main()
{
	;
}