#include<bits/stdc++.h>
using namespace std;

char zf[5] = {'a', 'e', 'i', 'o', 'u'};

long long n,q;
string s1;
string c[15],s[10005];

bool bv(char ch) {
	for (int i = 0;i < 5;i++) {
		if (ch == zf[i]) return true;
	}
	return false;
}

int main(){
	cin >> n >> q;
	for (int i = 1;i <= n;i++){
		cin >> c[i];
	}
	for (int i = 1;i <= q;i++){
		cin >> s[i];
	}
	for (int i = 1;i <= q;i++){
		int cnt = 0;
		for (int j = 1;j <= n;j++){
			long long xiabiao = s[i].find(c[j]);
			if (xiabiao != s[i].npos){
				if (s[i][xiabiao - 1] == 'n' && !bv(s[i][xiabiao - 1])){
					cnt++;
					continue;
				}else if (!(s[i][xiabiao - 1] == 'n') && !(bv(s[i][xiabiao]))){
					cnt++;
					continue;
				}else if (!bv(s[i][xiabiao - 1]) && !bv(s[i][xiabiao])) {
					cnt++;
					continue;
				}
			}
			if (j == 1){
				string s1 = c[j];
				continue;
			}
			else {
				if (s1 == c[j]){
					cnt--;
				}
			}
			if (cnt > 1) continue;
			string s1 = c[j];
		}
		if (cnt == 1){
			cout << "Yes, Commander" << endl;
		}else {
			cout << "No, Commander" << endl;
		}
	}
	
    return 0;
}