Given a set of strings S1 and some query strings S2. For each strings in S2, you need to determine whether it exists in set S1 or not.
First line contains 2 integers n and m, which is the size of S1 and S2. (0 < n,m <= 100)
Next, there're n lines, each representing a string in S1.
Last, m lines are provided, each representing a string in S2.
The length of strings is not greater than 10^3.
Print m lines. Each line contains "Yes" or "No", which means whether the i-th string in S2 exists in S1 or not.
Print '\n' in the last line.