1 #include <iostream>
  2 #include <string.h>
  3 #include <algorithm>
  4 #include <stack>
  5 #include <string>
  6 #include <math.h>
  7 #include <queue>
  8 #include <stdio.h>
  9 #include <string.h>
 10 #include <vector>
 11 #include <fstream>
 12 #include <set>
 13
 14 using namespace std;
 15 const int maxn = 255;
 16 char line[5100005];
 17 int kase, n, infecsum = 0, nodecou,l;
 18 struct node {
 19     node*next[26];
 20     node*prev;
 21     int count;
 22     node() {
 23         memset(next, 0, sizeof(next));
 24         prev = NULL;
 25         count = 0;
 26     }
 27 }tree[maxn * 1000];
 28
 29 void build() {
 30     for (int i = 0; i < 26; i++)
 31         tree[0].next[i] = tree + 1;
 32     tree[0].prev = NULL;
 33     tree[1].prev = tree;
 34     queue<node*>q;
 35     q.push(tree + 1);
 36     while (!q.empty()) {
 37         node*now = q.front();
 38         q.pop();
 39         for (int i = 0; i < 26; i++) {
 40             node*child = now->next[i];
 41             if (child) {
 42                 node*prev = now->prev;
 43                 while (prev->next[i] == NULL)
 44                     prev = prev->prev;
 45                 child->prev = prev->next[i];
 46                 q.push(child);
 47             }
 48         }
 49     }
 50 }
 51
 52 int search(char *str) {
 53     int ans = 0;
 54     node*first = tree + 1;
 55     for (int i = 0; str[i] != '\0'; i++) {
 56         while (first->next[str[i] - 'A'] == NULL&&first!=(tree+1))
 57             first = first->prev;
 58         if (first->next[str[i] - 'A'])
 59             first = first->next[str[i] - 'A'];
 60         node*tmp = first;
 61         while (tmp != NULL && tmp->count != -1) {
 62             ans += tmp->count;
 63             tmp->count = -1;
 64             tmp = tmp->prev;
 65         }
 66     }
 67     return ans;
 68 }
 69
 70 void insert(node*rt, char* line) {
 71     int l = strlen(line);
 72     for (int i = 0; i < l; i++) {
 73         if (rt->next[line[i] - 'A'] == NULL) {
 74             nodecou++;
 75             rt->next[line[i] - 'A'] = tree + nodecou;
 76         }
 77         rt = rt->next[line[i] - 'A'];
 78     }
 79     rt->count++;
 80 }
 81
 82 void stringin() {
 83     char ch;
 84     scanf("\n");
 85     while (scanf("%c", &ch)) {
 86         if (ch == '\n')
 87             break;
 88         if (ch == '[') {
 89             int c;
 90             scanf("%d", &c);
 91             scanf("%c", &ch);
 92             for (int i = 1; i <= c; i++)line[l++] = ch;
 93             scanf("%c", &ch);
 94         }
 95         else
 96             line[l++] = ch;
 97     }
 98     line[l] = '\0';
 99 }
100
101 void init() {
102     scanf("%d", &kase);
103     while (kase--) {
104         memset(tree, 0, sizeof(tree));
105         infecsum = 0, nodecou = 1,l=0;
106         scanf("%d", &n);
107         for (int i = 1; i <= n; i++) {
108             scanf("%s",line);
109             insert(tree + 1, line);
110         }
111         build();
112         stringin();
113         infecsum=search(line);
114         reverse(line,line+l);
115         infecsum+=search(line);
116         printf("%d\n", infecsum);
117     }
118 }
119
120 int main()
121 {
122     init();
123     return 0;
124 }