Given an article, find the number of appearance for queried strings.
The input includes multiple test cases. In each test case, the first line contains two integers, N and M (1 <= N <= 10, 1 <= M <= 100). N indicates the number of lines in the article, and M indicates the number of strings needs to search. The next N lines are for the article, and the length of each line <= 1000. The followed M lines contains M queries, one per line, the length of each query is less than or equal to 50. The input alphabet is (a-z, A-Z) and digit (0-9).
case 1: 1 <= line length <= 100, 1 <= query length <= 20
case 2: 1 <= line length <= 500, 1 <= query length <= 20
case 3: 1 <= line length <= 1000, 1 <= query length <= 50
case 4: 0 <= line length <= 1000, 1 <= query length <= 50
For each string, output the string and the number of appearance in the article, separate by ‘:’. Uppercase and lowercase are treated as the same alphabet.
Print a blank line after the output of each test case.