#include<fstream>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<vector>
#include<deque>
using namespace std;
ifstream fi("subsequence.in");
ofstream fo("subsequence.out");
string A,B;
vector <int> p[26];
int q[26];
int find(int ch,int l,int r,int temp)
{
	if(l>=r)return l;
	int mid=(l+r)>>1;
	if(temp>p[ch][mid])
		return find(ch,mid+1,r,temp);
	else
		return find(ch,l,mid-1,temp);
}
void work()
{
	int temp=-1,w;
	memset(q,0,sizeof(q));
	for(unsigned int j=0;j<B.length();j++)
	{
		int k=B[j]-'a';
		int w=find(k,0,p[k].size(),temp);
		if(w>=p[k].size())//当前字符往后找做不到
		{
			fo<<"No"<<endl;
			return;
		}
		else//Moving on
		{
			temp=p[k][w];
		}
	}
	fo<<"Yes"<<endl;	
}
int main()
{
	int M;
	fi>>A;
	for(unsigned int i=0;i<A.length();i++)
	{
		int k=A[i]-'a';
		p[k].push_back(i);
	}
	/*for(int i=0;i<26;i++)
	{
		fo<<char(i+'a')<<':';
		for(unsigned int j=0;j<p[i].size();j++)
			fo<<p[i][j]<<' ';
		fo<<endl;
	}*/
	fi>>M;
	for(int i=1;i<=M;i++)
	{
		fi>>B;
		work();
	}
	return 0;
}