//satyaki3794
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define MOD (1000000007LL)
#define LEFT(n) (2*(n))
#define RIGHT(n) (2*(n)+1)

using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;

ll pwr(ll base, ll p, ll mod = MOD){
ll ans = 1;while(p){if(p&1)ans=(ans*base)%mod;base=(base*base)%mod;p/=2;}return ans;
}


const int N = 500002;
int n, next_[N][28], jump[20][N];
char str[N];


bool check(int src, int dest){
	for(int i=19;i>=0;i--)
		if(jump[i][src] != -1 && jump[i][src] <= dest)
			src = jump[i][src];
	return (src == dest);
}


int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin>>(str+1);
    n = strlen(str+1);
    memset(next_, -1, sizeof(next_));
    for(int i=n;i>=1;i--){
    	int ch = str[i]-'a'+1;
    	next_[i][ch] = i+1;
    	for(int j=ch+1;j<=27;j++)
    		if(next_[i][j-1] != -1)
    			next_[i][j] = next_[next_[i][j-1]][j-1];
    	for(int j=1;j<ch;j++)
    		if(next_[i][27] != -1)
    			next_[i][j] = next_[next_[i][27]][j];
    }


// cout<<"next_:\n";
// for(int i=1;i<=n;i++){
// 	cout<<i<<": ";for(int j=1;j<=27;j++)	cout<<next_[i][j]<<" ";cout<<endl;
// }cout<<endl;


	memset(jump, -1, sizeof(jump));
	for(int i=n;i>=1;i--){
		jump[0][i] = next_[i][27];
		for(int j=0;j<19;j++)
			if(jump[j][i] != -1)
				jump[j+1][i] = jump[j][jump[j][i]];
	}

// cout<<"jump:\n";
// for(int i=1;i<=n;i++){
// 	cout<<i<<": ";for(int j=0;j<5;j++)	cout<<jump[j][i]<<" ";cout<<endl;
// }cout<<endl;


	int q;
	cin>>q;
	while(q--){

		int l, r;
		cin>>l>>r;

		if(check(l, r+1))	cout<<"Yes\n";
		else	cout<<"No\n";
	}

    return 0;
}





