#include <stdio.h>
#include <string.h>

#define MIN(X,Y) ((X) < (Y) ? (X) : (Y))
#define MAX(X,Y) ((X) > (Y) ? (X) : (Y))

void merge(char *arr, char *arr2, int low, int mid, int high);
void mergeSort(char *arr, char *arr2, int low, int high);

int main(void)
{
    char arr[1000001], arr2[1000001];
    int n, i, j;
    int a, b;

    scanf("%s %d", arr, &n);

    for(a = 0; a < n; a++)
    {
        memset(arr2, 0, 1000001);
        scanf("%d %d", &i, &j);
        mergeSort(arr, arr2, MIN(i, j), MAX(i, j));

        if(arr2[0] != arr2[j - i])
        {
            printf("No\n");
        }
        else
        {
            printf("Yes\n");
        }
    }

    return 0;
}

void mergeSort(char *arr, char *arr2, int low, int high)
{
    int mid;

    if(low < high)
    {
        mid = (low + high) / 2;
        mergeSort(arr, arr2, low, mid);
        mergeSort(arr, arr2, mid + 1, high);
        merge(arr, arr2, low, mid, high);
    }
}

void merge(char *arr, char *arr2, int low, int mid, int high)
{
    int i = low;
    int j = mid + 1;
    int k = low;

    while(i <= mid && j <= high)
    {
        if(arr[i] < arr[j])
        {
            arr2[k++] = arr[i++];
        }
        else if(arr[i] >= arr[j])
        {
            arr2[k++] = arr[j++];
        }
    }
}