#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<math.h>
#include<set>
#include<numeric>
#include<string>
#include<string.h>
#include<iterator>
#include<map>
#include<unordered_map>
#include<stack>
#include<list>
#include<queue>
#include<iomanip>

#define endl '\n';
typedef long long ll;
typedef pair<ll, ll>PII;
const int N = 2e6 + 50;
int f[N][70], cnt[N], idx = 1;
unordered_map<char, int>mymap;

void insert(string s)
{
	int p = 1;
	for (auto i : s)
	{
		int j = mymap[i];
		if (f[p][j] == 0)f[p][j] = ++idx;
		p = f[p][j];
		cnt[p]++;
	}
}

int search(string s)
{
	int p = 1;
	for (auto i : s)
	{
		int j = mymap[i];
		if (f[p][j] == 0)return 0;
		p = f[p][j];
	}
	return cnt[p];
}

int main()
{
	int t;
	int ans = 0;
	for (char i = 'a'; i <= 'z'; i++)
		mymap[i] = ans++;
	
	for(char i='0';i<='9';i++)
		mymap[i] = ans++;

	for (char i = 'A'; i <= 'Z'; i++)
		mymap[i] = ans++;

	cin >> t;
	while (t--)
	{
		memset(f, 0, sizeof f);
		memset(cnt, 0, sizeof cnt);
		idx = 1;
		int n, m;
		cin >> n >> m;
		string s;
		for (int i = 0; i < n; i++)
		{
			cin >> s;
			insert(s);
		}
		while (m--)
		{
			cin >> s;
			cout << search(s) << endl;
		}
	}
    return 0;
}