#define Local
#include <iostream>
#include <iomanip>
#include <string>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>using namespace std;#define MAX 10000 + 10
char ign[50][20], title[MAX][MAX], keyword[MAX][MAX];
int m, n, p; //m记录忽略单词的个数,n记录标题的个数,p是关键字数void Input()
{char s[MAX];while (fgets(s, MAX, stdin) != NULL){s[strlen(s)-1] = '\0';if (':' == s[0])break;strcpy(ign[m++], s);}while (fgets(s, MAX, stdin) != NULL){s[strlen(s)-1] = '\0';strcpy(title[n++], s);}
}void Strlwr()
{int i = 0, j = 0;for (i = 0; i < n; i++)for (j = 0; j < strlen(title[i]); j++)if (title[i][j] >= 'A' && title[i][j] <= 'Z')title[i][j]  += 'a' - 'A';
}int Search_1(char s[])
{int i = 0;for (i = 0; i < m; i++)//存在{if (!strcmp(s, ign[i]))return 0;}return 1;
}int Search_2(char s[])
{int i = 0;for (i = 0; i < p; i++)//好奇怪这一直写成m居然还能通过那么多样例。//存在{if (!strcmp(keyword[i], s))return 0;}return 1;
}void ExtractAndSearch(char s[], int num)
{int i = 0, j = 0;char temp[20];for (i = 0; i < strlen(s); i++){j = 0;memset(temp, '\0', sizeof(temp));while (' ' != s[i] && i < strlen(s)){temp[j++] = s[i++];}temp[j] = '\0';if (Search_1(temp) && Search_2(temp))//不存在的话{strcpy(keyword[p], temp);p++;}}
}int cmp(const void *a, const void *b)
{return strcmp((char *)a, (char *)b);
}void Output()
{int i = 0, j = 0, k = 0, l = 0;for (i = 0; i < p; i++)//关键字的个数 {for (j = 0; j < n; j++)//标题的数【j写成i】又是致命错误{char temp[20];int pos_1 = 0, pos_2 = 0;for (k = 0; k < strlen(title[j]); k++){l = 0;memset(temp, '\0', sizeof(temp));pos_1 = k;while (' ' != title[j][k] && k < strlen(title[j])){temp[l++] = title[j][k++];}temp[l] = '\0';pos_2 = k;if (!strcmp(keyword[i], temp)){for (l = pos_1; l < pos_2; l++)title[j][l] -= 'a' - 'A';puts(title[j]);for (l = pos_1; l < pos_2; l++)title[j][l] += 'a' - 'A';}}}}
}int main()
{
#ifdef Localfreopen("a.in", "r", stdin);freopen("a.out", "w", stdout);
#endifint i = 0, j = 0;Input();Strlwr();for (i = 0; i < n; i++)//提取单词 并查找插入{ExtractAndSearch(title[i], i);}qsort(keyword, p, sizeof(keyword[0]), cmp);Output();
}