#include<stdio.h>#include<string.h>#define MAXD 500010#define MAXT 1000010char b[60], txt[MAXT];int N, next[MAXD][26], flag[MAXD], P[MAXD], q[MAXD], e, cnt;void insert(int cur, int k){    ++ e;    flag[e] = 0;    memset(next[e], 0, sizeof(next[e]));    next[cur][k] = e;}void init(){int i, j, k, cur;    scanf("%d", &N);    e = 0;    memset(next[e], 0, sizeof(next[e]));for(i = 0; i < N; i ++)    {        scanf("%s", b);        cur = 0;for(j = 0; b[j]; j ++)        {            k = b[j] - 'a';if(!next[cur][k])                insert(cur, k);            cur = next[cur][k];        }        ++ flag[cur];    }}void prepare(){int i, j, k, u, x, front, rear;    front = rear = 0;    P[0] = q[rear ++] = 0;while(front < rear)    {        u = q[front ++];for(i = 0; i < 26; i ++)if(next[u][i])            {                x = next[u][i];if(u == 0)                    P[x] = 0;else                {for(j = P[u]; j != 0; j = P[j])if(next[j][i])                        {                            P[x] = next[j][i];break;                        }if(j == 0)                        P[x] = next[0][i];                }                q[rear ++] = next[u][i];            }    }}void solve(){int i, j, k, t;    prepare();    scanf("%s", txt);    j = cnt = 0;for(i = 0; txt[i]; i ++)    {        k = txt[i] - 'a';while(j > 0 && !next[j][k])            j = P[j];        j = next[j][k];for(t = j; t > 0; t = P[t])        {if(flag[t] >= 0)            {                cnt += flag[t];                flag[t] = -1;            }elsebreak;        }    }    printf("%d\n", cnt);}int main(){int t;    scanf("%d", &t);while(t --)    {        init();        solve();    }return 0;}