#include<bits/stdc++.h>
#define For(i,j,k)	for(int i=j;i<=k;++i)
#define Dow(i,j,k)	for(int i=k;i>=j;--i)
#define ll long long
#define PI acos(-1)

using namespace std;

inline ll read()
{
	ll t=0,f=1;char c=getchar();
	while(!isdigit(c))	{if(c=='-')	f=-1;c=getchar();}
	while(isdigit(c))	t=t*10+c-48,c=getchar();
	return t*f;
}
inline void write(ll x){if(x<0)	{putchar('-');x=-x;}	if(x>=10)	write(x/10);putchar(x%10+48);}
inline void writeln(ll x){write(x);puts("");}
inline void write_p(ll x){write(x);putchar(' ');}

const int N=500006;
char s[N];
int jump[N],nxt[N],Fa[N][22],n,que,to[N][31],q[N],trans[N][31];
int main()
{
//	freopen("fusion.in","r",stdin);freopen("fusion.out","w",stdout);
	scanf("\n%s",s+1);
	n=strlen(s+1);que=read();
	to[n][s[n]-'a']=n;
	Dow(i,1,n-1)
	{
		to[i][s[i]-'a']=i;
		int now=i+1,nc=s[i]-'a';
		while(1)
		{
			int tmp=now,top=0;
			while(!to[now][nc]&&nxt[now])	
			{
				q[++top]=now;
				now=nxt[now]+1;
				if(trans[now][nc])	now=trans[now][nc];
			}
			if(!to[now][nc])	break;
			For(j,1,top)	trans[q[j]][nc]=now;
			now=to[now][nc]+1;nc++;to[i][nc]=now-1;
			if(nc>'z'-'a')	break;
		}
		nxt[i]=to[i]['z'-'a'+1];
	}
	For(i,1,n-1)	if(nxt[i])	Fa[i][0]=nxt[i]+1;
	For(j,1,21)	
		For(i,1,n-1)	
				if(Fa[i][j-1])	Fa[i][j]=Fa[Fa[i][j-1]][j-1];
	
	For(i,1,que)
	{
		int l=read(),r=read();
		bool cg=0;
		Dow(j,0,21)
		{
			if(Fa[l][j])	if(Fa[l][j]<=r)	l=Fa[l][j];else	if(Fa[l][j]-1==r)	{puts("Yes");cg=1;break;}
		}
		if(!cg)	puts("No");
	}
}
/*
xxyzzwwxzzyz
1
6 12
*/