In the modern time,Search engine came into the life of everybody like GOOGLE,Baidu,etc.
Wiskey also wants to bring this feature to his image retrieval sy@R_301_2407@.
Every image have a long description,when users tyPE some keywords to find the image,the sy@R_301_2407@ will match the keywords with description of image and show the image which the most keywords be matched.
To simplify the problem,giving you a description of image,and some keywords,you should tell me how many keywords will be match.

First line will contain one integer means how many cases will follow by.
each case will contain two integers N means the number of keywords and N keywords follow. (N <= 10000)
Each keyword will only contains characters ‘a‘-‘z‘,and the length will be not longer than 50.
The last line is the description,and the length will be not longer than 1000000.

Print how many keywords are contained in the description.

 题意：给出n个关键字字符串，然后给出一个字符串s，问有多少个关键字字符串出现在字符串s。

看到这道题，发现这是一道字符串匹配的题，那么很容易想到KMP来解，然而当关键字足够多的时候，那么肯定超时，用trie树也一样，这时我们需要一个新的算法来解决这个问题了：AC自动机。

这里给出一篇关于AC自动机的博客吧：https://bestsort.cn/2019/04/28/402/

@H_406_83@

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+5;
int tre[maxn][30];
int sum[maxn];
char ch1[maxn];
char ch[105];
queue<int> que;
int fail[maxn];
void insert(char * ch,int &amp; cnt){
	int rt=0;
	int len=strlen(ch);
	for(int i=0;i<len;i++){
		int tem=ch[i]-‘a‘;
		if(tre[rt][tem]==0){
			tre[rt][tem]=++cnt;	
		}
		rt=tre[rt][tem];
	}
	sum[rt]++;
	return ;
}
void getfail(){
	while(!que.empty())que.pop();
	int Now=0;
	for(int i=0;i<26;i++){
		if(tre[Now][i]==0)continue;
		que.push(tre[Now][i]);
	}
	while(!que.empty()){
		Now=que.front();
		que.pop();
//		cout<<Now<<endl;
		for(int i=0;i<26;i++){
			if(tre[Now][i]!=0){
				fail[tre[Now][i]]=tre[fail[Now]][i];
				que.push(tre[Now][i]);
			}
			else{
				tre[Now][i]=tre[fail[Now]][i];
			}
		}
	}
//	puts("YES");
}
int query(char * ch){
	int len=strlen(ch);
	int ans=0;
	int Now=0;
	for(int i=0;i<len;i++){
		Now=tre[Now][ch[i]-‘a‘];
		for(int j=Now;j&&sum[j]!=-1;j=fail[j]){
			ans+=sum[j];
			sum[j]=-1;
		}
	}
	return ans;
}
int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		int n;
		int cnt=0;
		memset(sum,sizeof(sum));
		memset(fail,sizeof(fail));
		memset(tre,sizeof(tre));
		scanf("%d",&n);
		for(int i=0;i<n;i++){
			scanf("%s",ch);
			insert(ch,cnt);
		}
		getfail();
		scanf("%s",ch1);
		printf("%d\n",query(ch1));
	}
	return 0;
}