Watto, the owner of a spare parts store, has recently got an order for the mechanism that can process strings in a certain way. Initially the memory of the mechanism is filled with n strings. Then the mechanism should be able to process queries of the following type: "Given string s, determine if the memory of the mechanism contains string t that consists of the same number of characters as s and differs from s in exactly one position".

Watto has already compiled the mechanism, all that's left is to write a program for it and check it on the data consisting of n initial lines and m queries. He decided to entrust this job to you.

Input

The first line contains two non-negative numbers n and m (0 ≤ n ≤ 3·105, 0 ≤ m ≤ 3·105) — the number of the initial strings and the number of queries, respectively.

Next follow n non-empty strings that are uploaded to the memory of the mechanism.

Next follow m non-empty strings that are the queries to the mechanism.

The total length of lines in the input doesn't exceed 6·105. Each line consists only of letters 'a', 'b', 'c'.

Output

For each query print on a single line "YES" (without the quotes), if the memory of the mechanism contains the required string, otherwise print "NO" (without the quotes).

Examples

Input

2 3
aaaaa
acacaca
aabaa
ccacacc
caaac


Output

YES
NO
NO
import java.util.*;
import java.io.*;

public class Main {

	BufferedReader in;
	StringTokenizer str = null;
	PrintWriter out;
	
	private String next() throws Exception{
		while (str == null || !str.hasMoreElements())
			str = new StringTokenizer(in.readLine());
		return str.nextToken();
	}
	
	private int nextInt() throws Exception{
		return Integer.parseInt(next());
	}
	
	private long nextLong() throws Exception{
		return Long.parseLong(next());
	}
	
	private double nextDouble() throws Exception{
		return Double.parseDouble(next());
	}
	
	Node []tree;
	int size = 0;
	char []a;
	public void run() throws Exception{
		in =  new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
		int n = nextInt(), m = nextInt();
		tree = new Node[300010];
		tree[size++] = new Node();
		for(int i = 0; i < n; ++i) addString(next().toCharArray());
		for(int i = 0; i < m; ++i) {
			a = next().toCharArray();
			if (go(0, 0, 1)) {
				out.println("YES");
			}else {
				out.println("NO");
			}
		}
		out.close();
	}

	private boolean go(int pos, int v, int flag) {
		if (pos == a.length) {
			return tree[v].leaf && flag == 0;
		}
		int next = tree[v].next[a[pos] - 'a'];
		if (next == -1) {
			if (flag == 0) {
				return false;
			}
		}
		if (next >= 0 && go(pos + 1, next, flag))
			return true;
		if (flag > 0) {
			for(int i = 0; i < 3; ++i) {
				if (tree[v].next[i] != -1) {
					if (tree[v].next[i] == next) continue;
					if (go(pos + 1, tree[v].next[i], 0)) {
						return true;
					}
				}
			}
		}
		return false;
	}

	private void addString(char []x) {
		int v = 0;
		for(int i = 0; i < x.length; ++i) {
			int to = x[i] - 'a';
			if (tree[v].next[to] == -1) {
				tree[size] = new Node();
				tree[v].next[to] = size++;
			}
			v = tree[v].next[to];
		}
		tree[v].leaf = true;
	}

	class Node {
		int []next;
		boolean leaf = false;
		public Node() {
			next = new int[3];
			Arrays.fill(next, -1);
		}
	}
		
	public static void main(String[] args) throws Exception{
		new Main().run();
	}
}
