#include <stdio.h>

#include <stdlib.h>

int main(){

    int n,i,j,q[1000000];

    char t1,t2,p[1000001];

    scanf("%s",p);

    q[0]=0;

    for(i=0,j=1;p[j];j++){

        if(p[i]!=p[j]) i=j;

        q[j]=j-i;

    }

    scanf("%d",&n);

    while(n--){

        scanf("%d%d",&i,&j);

        if(q[(i>j)?i:j]>=abs(i-j)) printf("Yes\n");

        else printf("No\n");

    }

    return 0;

}

 #include <iostream> 

#include <stdio.h> 



using namespace std; 



    unsigned int ar[1000001]; 

    char input[1000003]; 

int main(void){ 

        int count = 0; 

        int k = 0; 

        scanf("%s", input); 

        ar[0] = count; 

        while(input[++k] != NULL){ 

            if(input[k-1] != input[k]) 

                count++; 

            ar[k] = count;     

        } 



        int caseNum; 

        cin >> caseNum; 

        while(caseNum--){ 

            int t1, t2; 

            cin >> t1 >> t2; 

            if(ar[t1] == ar[t2]) 

                cout << "Yes" << endl; 

            else 

                cout << "No" << endl; 

        } 



    return 0; 

}