#include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
#include <cstdio>
#include <complex>
#include <cstring>

using namespace std;

const int N = 500000 + 5;
const int C = 26;

int n, m;
int root, tot;
int ch[N][C];
char s[N];
int p[N + N];
int ans[N];
vector<pair<int, int>> vec[N];

int getp(int u)
{
    return p[u] == u ? u : p[u] = getp(p[u]);
}

void merge(int u, int v)
{
    int pv = getp(v + N);
    int pu = getp(u + N);
    p[pv] = pu;

    for(int i = 0; i < C; ++ i) {
        if (ch[v][i] == 0) continue;
        if (ch[u][i] == 0) {
            ch[u][i] = ch[v][i];
        } else {
            merge(ch[u][i], ch[v][i]);
        }
    }
}

void solve()
{
    scanf("%s", s);
    n = strlen(s);
    cin >> m;
    for(int i = 0; i < m; ++ i) {
        int l, r;
        scanf("%d%d", &l, &r);
        --l, --r;
        vec[r].push_back(make_pair(l, i));
    }

    tot = 1;
    root = tot ++;

    for(int i = 0; i < N + N; ++ i) {
        p[i] = i;
    }

    for(int i = 0; i < n; ++ i) {
        int c = s[i] - 'a';
        int nroot = tot ++;
        ch[nroot][c] = root;
        p[i] = root + N;

        for(int cur = c; cur < C; ++ cur) {
            int t = ch[ch[nroot][cur]][cur];
            if (t == 0) break;
            ch[ch[nroot][cur]][cur] = 0;

            if (cur == C - 1) {
                if (t) {
                    merge(nroot, t);
                }
            } else {
                if (t) {
                    ch[nroot][cur + 1] = t;
                }
            }
        }

        for(auto l: vec[i]) {
            int tmp = getp(l.first) - N;
            ans[l.second] = (tmp == nroot);
        }

        root = nroot;
    }

    for(int i = 0; i < m; ++ i) {
        if (ans[i]) puts("Yes");
        else puts("No");
    }
}

int main()
{
    solve();
    return 0;
}
