1 #include <queue>
  2 #include <cstring>
  3 #include <cstdio>
  4 using namespace std;
  5 
  6 struct AC_auto
  7 {
  8     const static int LetterSize = 27;
  9     const static int TrieSize = 27 * ( 1e5 + 50);
 10 
 11     int tot,root,fail[TrieSize],end[TrieSize],next[TrieSize][LetterSize];
 12 
 13     int newnode(void)
 14     {
 15         memset(next[tot],-1,sizeof(next[tot]));
 16         end[tot] = 0;
 17         return tot++;
 18     }
 19 
 20     void init(void)
 21     {
 22         tot = 0;
 23         root = newnode();
 24     }
 25 
 26     int getidx(char x)
 27     {
 28         if(x<=‘z‘&&x>=‘a‘) return x - ‘a‘;
 29         if(x<=‘Z‘&&x>=‘A‘) return x - ‘A‘;
 30         return 26;
 31     }
 32 
 33     void insert(char *ss)
 34     {
 35         int len = strlen(ss);
 36         int now = root;
 37         for(int i = 0; i < len; i++)
 38         {
 39             int idx = getidx(ss[i]);
 40             if(next[now][idx] == -1)
 41                 next[now][idx] = newnode();
 42             now = next[now][idx];
 43         }
 44         end[now] = len;
 45     }
 46 
 47     void build(void)
 48     {
 49         queue<int>Q;
 50         fail[root] = root;
 51         for(int i = 0; i < LetterSize; i++)
 52             if(next[root][i] == -1)
 53                 next[root][i] = root;
 54             else
 55                 fail[next[root][i]] = root,Q.push(next[root][i]);
 56         while(Q.size())
 57         {
 58             int now = Q.front();Q.pop();
 59             for(int i = 0; i < LetterSize; i++)
 60             if(next[now][i] == -1)   next[now][i] = next[fail[now]][i];
 61             else
 62                 fail[next[now][i]] = next[fail[now]][i],Q.push(next[now][i]);
 63         }
 64     }
 65 
 66     void match(char *ss,int *cnt)
 67     {
 68         int len,now;
 69         len = strlen(ss),now = root;
 70         for(int i = 0; i < len; i++)
 71         {
 72             int idx = getidx(ss[i]);
 73             int tmp = now = next[now][idx], ret = 0;
 74             while(tmp)
 75             {
 76                 ret = max( ret, end[tmp]);
 77                 tmp = fail[tmp];
 78             }
 79             if(ret)
 80                 cnt[i-ret+1]++,cnt[i+1]--;
 81         }
 82     }
 83     void debug()
 84     {
 85         for(int i = 0;i < tot;i++)
 86         {
 87             printf("id = %3d,fail = %3d,end = %3d,chi = [",i,fail[i],end[i]);
 88             for(int j = 0;j < LetterSize;j++)
 89                 printf("%3d",next[i][j]);
 90             printf("]\n");
 91         }
 92     }
 93 }ac;
 94 
 95 char ss[1000007];
 96 int cnt[1000007];
 97 
 98 int main(void)
 99 {
100     int t,n;
101     scanf("%d",&t);
102     while(t--)
103     {
104         ac.init();
105         scanf("%d",&n);
106         for(int i=1;i<=n;i++)   scanf("%s",ss),ac.insert(ss);
107         getchar(),gets(ss);
108         ac.build();
109         ac.match(ss,cnt);
110         for(int i=0,ret=0,len=strlen(ss);i<len;i++)
111         {
112             ret+=cnt[i],cnt[i]=0;
113             if(ret>0)   ss[i]=‘*‘;
114         }
115         printf("%s\n",ss);
116     }
117     return 0;
118 }