RE求调整

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 3000005;
int son[N][65], cnt[N], idx;
char str[N];
void insert(char* str)
{
	
	int p = 0;
	for (int i = 0;str[i];i++)
	{
		int u = str[i] - '0';
		if (!son[p][u])son[p][u] = ++idx;
		p = son[p][u];
		cnt[p]++;
	}
	
}
int que(char* str)
{
	int p = 0;
	for (int i = 0;str[i];i++)
	{
		int u = str[i] - '0';
		if (!son[p][u])return 0;
		p = son[p][u];
	}
	return cnt[p];
}
int main()
{
	cin.tie(0);cout.tie(0);
	ios_base::sync_with_stdio;
	int m;
	cin >> m;
	while (m--)
	{
		int t, e;
		cin >> t >> e;
	 for(int i=0;i<=idx;i++)
            cnt[i]=0;
		while (t--)
		{
			cin >> str;
			insert(str);
		}
		while (e--)
		{
			cin >> str;
			cout << que(str) << endl;
		}

		
	}
	return 0;
}