The input file contains several test cases. Each test case consists of several lines. The first line of each test case will contain two integers separated by a single space: N, the number of emoticons to proscribe, and M, the number of lines the text has. The next N lines contain one emoticon each, a non-empty string of at most 15 characters. Each of the last M lines of the test case contains a line of text of at most 80 characters. You can assume 1 <= N,M <= 100.
Valid input characters for emoticons are uppercase and lowercase letters, digits and the symbols“!?.,:;-_’#$%&/=*+(){}[]” (quotes for clarity). Each line of the text may contain the samecharacters with the addition of the space character.
The input is terminated by N = M = 0.