hdu2222

/**/
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <stack>
#include <queue>

typedef long long LL;
using namespace std;

int t;
int n;
char s[55];
char str[1000005];

struct AC_Automaton
{
    int ch[500005][26], fail[500005], cnt[500005];
    int tot;

    void init(){
        tot = 0;
        memset(ch, -1, sizeof(ch));
        memset(fail, 0, sizeof(fail));
        memset(cnt, 0, sizeof(cnt));
    }

    void insert(char *ss){
        int p = 0, len = strlen(ss);
        for (int i = 0; i < len; i++){
            //if(ch[p] == NULL){
            //    ch[p] = new int[26];
            //    memset(ch[p], -1, sizeof(int) * 26);
            //}
            if(ch[p][ss[i] - 'a'] == -1){
                ch[p][ss[i] - 'a'] = ++tot;
            }
            p = ch[p][ss[i] - 'a'];
        }
        cnt[p]++;
    }

    void build(){
        int l = 0, r = 0, q[500005];
        for (int i = 0; i < 26; i++){
            if(ch[0][i] == -1){
                ch[0][i] = 0;
            }else{
                q[r++] = ch[0][i];
            }
        }
        while(l < r){
            int p = q[l++];
            //if(ch[p] == NULL) continue;
            for (int i = 0; i < 26; i++){
                if(ch[p][i] == -1){
                    ch[p][i] = ch[fail[p]][i];
                }else{
                    fail[ch[p][i]] = ch[fail[p]][i];
                    q[r++] = ch[p][i];
                }
            }
        }
    }

    int count(char *ss){
        int p = 0, ans = 0;
        int len = strlen(ss);
        for (int i = 0; i < len; i++){
            //if(ch[p] == NULL) continue;
            p = ch[p][ss[i] - 'a'];
            int temp = p;
            while(temp){
                ans += cnt[temp];
                cnt[temp] = 0;
                temp = fail[temp];
            }
        }
        return ans;
    }

}AC;

int main()
{
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);

    scanf("%d", &t);
    while(t--){
        scanf("%d", &n);
        AC.init();
        for (int i = 1; i <= n; i++){
            scanf("%s", s);
            AC.insert(s);
        }
        AC.build();
        scanf("%s", str);
        printf("%d\n", AC.count(str));
    }

    return 0;
}
/**/