#include <bits/stdc++.h>
using namespace std;

long long tree[11451][100];
long long T,n,q;
long long now;
long long jh[114514];

int push_char(char x){
    if(x >= 'A' && x <= 'Z') return x - 'A';
    else if(x >= 'a' && x <= 'z') return x - 'a' + 26;
    else return x - '0' + 52;
} 

int find(char s[]) {
	long long v = 0;
	for (long long i = 0;i < strlen(s);i++) {
		long long temp = push_char(s[i]);
		if (!tree[v][temp]) return 0;
		v = tree[v][temp];
	}
	return jh[v];
}

int main ( ) {
	ios::sync_with_stdio(0);
	cin >> T ;
	while (T--) {
		for(int i = 0;i <= now;i++)
		    for(int j = 0;j <= 69;j++) tree[i][j] = 0;
		for(int i = 0;i <= now;i++) jh[i] = 0;
		cin >> n >> q ;
		char s[114514];
		for (long long i = 1;i <= n;i++) {
			cin >> s;
			long long v = 0;
			for (long long i = 0;i < strlen(s);i++) {
				long long temp = push_char(s[i]);
				if (!tree[v][temp]) tree[v][temp] = ++now;
				v = tree[v][temp];
				jh[v]++;
			}
		}
		for (long long i = 1;i <= q;i++) {
			cin >> s;
			cout << find(s) << '\n' ;
		}
	}
}