#include <iostream>
#include <cstdio>
#include <cstring>
#include <set>
#include <string>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;

const int MAXN = 1e3 + 10;

int n, m, eid;
string Str, Str2;
string MM[MAXN];

struct node {
	string str;
	int type;
	bool operator < (const node &a) {
		return str < a.str;
	}
} A[110];

map<string, int> M[MAXN];
vector<int> G[MAXN];
set<int> Child[MAXN], Front;
bool used[MAXN];

int dfs(int k) { 
	if (!used[k]) return 1;
	if (Child[k].empty()) return 0;
	int ans = 0;
	for (auto x: Child[k]) {
		ans += dfs(x);
	}
	return ans;
}

int main() {
	int t;
	scanf("%d", &t);
	for (int u = 1; u <= t; u++) {
		for (int i = 0; i < MAXN; i++) used[i] = false;
		eid = 0;
		scanf("%d %d", &n, &m);
		for (int i = 0; i < MAXN; i++)
			M[i].clear();
		for (int i = 1; i <= n + m; i++) G[i].clear();
		for (int i = 1; i <= n; i++) {
			cin >> A[i].str;
			A[i].type = 1;
		}
		for (int i = n + 1; i <= n + m; i++) {
			cin >> A[i].str;
			A[i].type = 2;
		}
		sort(A + 1, A + 1 + n + m);
		for (int i = 1; i <= n + m; i++) {
			int cnt = 0;
			Str = "";
			Str2 = "";
			for (int j = 0; j <= A[i].str.length(); j++) {
				cnt++;
				if ('a' <= A[i].str[j] && A[i].str[j] <= 'z') {
					Str = Str + A[i].str[j];
				} else {
					if (M[cnt][Str]) {
						if (MM[M[cnt][Str]] != Str2) {
							eid++;
							G[i].push_back(eid);
							MM[eid] = Str2;
							M[cnt][Str] = eid;
						} else {
							G[i].push_back(M[cnt][Str]);
						}
					} else {
						eid++;
						M[cnt][Str] = eid;
						G[i].push_back(eid);
						MM[eid] = Str2;
					}
					Str = "";
				}
				Str2 = Str2 + A[i].str[j];
			}
			cnt++;
			if (M[cnt][Str]) {
				if (MM[M[cnt][Str]] != Str2) {
					eid++;
					G[i].push_back(eid);
					MM[eid] = Str2;
					M[cnt][Str] = eid;
				} else {
					G[i].push_back(M[cnt][Str]);
				}
			} else {
				eid++;
				M[cnt][Str] = eid;
				G[i].push_back(eid);
				MM[eid] = Str2;
			}
		}	
		for (int i = 0; i < MAXN; i++) Child[i].clear();
		Front.clear();
		for (int i = 1; i <= n + m; i++) {
			if (A[i].type == 1) {
				Front.insert(G[i][0]);
				for (int j = 0; j < G[i].size() - 1; j++)
					Child[G[i][j]].insert(G[i][j + 1]); 
			} else {
				for (int j = 0; j < G[i].size() - 1; j++)
					used[G[i][j]] = true;
				used[G[i][G[i].size() - 1]] = true;
			}
		}
		int Ans = 0;
		for (auto x:Front) {
			Ans += dfs(x);
		} 
		printf("%d\n", Ans);
	}
	return 0;
}