KMP

	nxt[0]=-1;
	int j=0;
	for(int i=2;i<=len2;i++)
	{
		while(j&&s2[j+1]!=s2[i]) j=nxt[j];
		if(s2[j+1]==s2[i]) j=j+1;
		nxt[i]=j;
	}//自己匹配
	
	j=0;
	for(int i=1;i<=len1;i++)
	{
		stk[++top]=i;
		while(j&&s2[j+1]!=s1[i]) j=nxt[j];
		if(s2[j+1]==s1[i]) j=j+1;
	}//与别人匹配

#include<bits/stdc++.h>
using namespace std;
char s1[120000];
int nex[120000];
int n,m;
char s2[120000];
int len1;
void nx(char str[]){
	int j=0;
	nex[0]=-1;
	for(int i=2;i<=len1;i++){
		while(j&&str[j+1]!=str[i]) j=nex[j];
		if(str[j+1]==str[i]) j++;
		nex[i]=j;
	}
}
int kmp(char str[]){
	int len=strlen(str+1),j=0;
	for(int i=1;i<=len;i++){
		while(j&&s1[j+1]!=str[i]) j=nex[j];
		if(s1[j+1]==str[i]) j++;
		if(j==len1) return 1;
	}
	return 0;
}
int main(){
	scanf("%s",s1+1);
	len1=strlen(s1+1);
	nx(s1);
	cin>>n;
	for(int i=1;i<=n;i++){
		memset(s2,0,sizeof(s2));
		scanf("%s",s2+1);
		if(kmp(s2)) cout<<"YES"<<endl;
		else cout<<"NO"<<endl;
	}
}