#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define pii pair<int,int>
#define mk make_pair
#define ft first
#define se second
#define pb push_back
#define db double
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f
#define inf 9e18
using namespace std;
void chkmx(int &x,int y){if(x<y) x=y;}
void chkmn(int &x,int y){if(x>y) x=y;}
inline int read(){
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') {x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
	return x*f;
}
#define M 20
int N,S,T,cur,a[M],b[M],to[30],To[M],sum[M];
char s[M],t[M],res[M],in[M];
unordered_map<string,int> mp;
bool vis[M];
void dfs(int k){
	if(k==cur+1){
		memset(b,0,sizeof(b));
		for(int i=1;i<=cur;i++) b[a[i]]=i;
		memset(sum,0,sizeof(sum));
		int L=0;
		for(int i=0;i<T;i++){
			sum[i]+=a[s[i]]+a[t[i]];
			if(sum[i]>=10) sum[i+1]++,sum[i]-=10,L=i+1;
		}
		memset(res,0,sizeof(res));
		for(int i=0;i<=L;i++){
			if(~To[b[sum[i]]]) res[i]=To[b[sum[i]]];
			else res[i]=50;
		}
		mp[res]++;
		return;
	}
	for(int i=0;i<=9;i++){
		if(!vis[i]){
			a[k]=i,vis[i]=1;
			dfs(k+1);
			vis[i]=0;
		}
	}
}
int main(){
	scanf("%s%s",s,t);
	N=strlen(s),S=strlen(t),T=max(N,S);
	reverse(s,s+N);
	reverse(t,t+S);
	memset(To,-1,sizeof(To));
	for(int i=0;i<N;i++){
		if(!to[s[i]-'a']) to[s[i]-'a']=++cur,To[cur]=s[i]-'a';
		s[i]=to[s[i]-'a'];
	}
	for(int i=0;i<S;i++){
		if(!to[t[i]-'a']) to[t[i]-'a']=++cur,To[cur]=t[i]-'a';
		t[i]=to[t[i]-'a'];
	}
	dfs(1);
	int n=read(),m=read(),k=read();
	while(n--){
		scanf("%s",in);
		int len=strlen(in);
		reverse(in,in+len);
		for(int i=0;i<len;i++){
			if(to[in[i]-'a']) in[i]-='a';
			else in[i]=50;
		}
		int tmp=mp[in];
		if(tmp%m==k) puts("YES");
		else puts("NO");
	}
	return 0;
}