1 #include <cstdio>
 2 #include <cstring>
 3 
 4 #define MAXM 1000005
 5 
 6 int T, n, tot, q[MAXM], ls, l, r;
 7 char s[55], ch[MAXM];
 8 
 9 struct Tree {
10     int a[26], x, f;
11 } t[MAXM];
12 
13 void insert() {
14     int o = r;
15     for (int i = 0; i < ls; i++) {
16
 
         int x = s[i] - 'a';
17         if (!t[o].a[x]) t[o].a[x] = ++tot;
18         o = t[o].a[x];
19     }
20     t[o].x++;
21 }
22 
23 void getf() {
24     int head = 1, tail = 2;
25     q[1] = r;
26     while (head != tail) {
27         int o = q[head];
28         for (int i = 0; i <= 25
 
; i++) {
29             int v = t[o].a[i];
30             if (!v) continue;
31             if (o == r) t[v].f = r;
32             else {
33                 int of = t[o].f;
34                 while (of) {
35                     if (t[of].a[i]) {
36                         t[v].f = t[of].a[i];
 
37                         break;
38                     }
39                     of = t[of].f;
40                 }
41                 if (!of) t[v].f = r;
42             }
43             q[tail++] = v; 
44         }
45         head++;
46     }
47 }
48 
49 int find() {
50     int ans = 0, x = r;
51     for (int i = 0; i < l; i++) {
52         int o = ch[i] - 'a';
53         while (!t[x].a[o] && x != r) x = t[x].f;
54         x = t[x].a[o] ? t[x].a[o] : r;
55         int y = x;
56         while (t[y].x) ans += t[y].x, t[y].x = 0, y = t[y].f;
57     }
58     return ans;
59 }
60 
61 int main() {
62     scanf("%d", &T);
63     for (int i = 1; i <= T; i++) {
64         scanf("%d", &n), r = ++tot;
65         for (int j = 1; j <= n; j++) scanf("%s", s), ls = strlen(s), insert();
66         getf();
67         for (int j = r + 1; j <= tot; j++) if (!t[j].f) t[j].f = r;
68         scanf("%s", ch), l = strlen(ch);
69         printf("%d\n", find());
70     }
71     return 0;
72 }