#include <cstdio>
#include <cstring>

const int N = 500000 + 10, S = 26;

int n;
char s[N];

int m, succ[N][S + 1], mem[S][N];

int anc[N];

int find(int x) { return anc[x] == x ? x : (anc[x] = find(anc[x])); }

inline void check(int &lhs, int rhs) {
  lhs = (!lhs || (rhs && rhs < lhs) ? rhs : lhs);
}

void meld(int x, int y) {
  for (int i = 0; i <= S; ++i) check(succ[x][i], succ[y][i]);
}

int go(int x, int y) {
  for (int i = S - 1; i >= 0; --i) if (mem[i][x] && mem[i][x] <= y) x = mem[i][x];
  return mem[0][x];
}

int main() {
  scanf(" %s%d", s + 1, &m);
  n = strlen(s + 1);
  for (int i = 1; i <= n + 1; ++i) anc[i] = i;
  for (int i = 1; i <= n; ++i) succ[i][s[i] - 'a'] = i + 1;
  for (int i = n; i > 0; --i) {
    for (int j = 1; j <= S; ++j) check(succ[i][j], succ[find(succ[i][j - 1])][j - 1]);
    if (succ[i][S]) meld(i, succ[i][S]);
  }
  for (int i = 1; i <= n; ++i) mem[0][i] = succ[i][S];
  for (int i = 1; i < S; ++i)
    for (int j = 1; j <= n; ++j)
      mem[i][j] = mem[i - 1][mem[i - 1][j]];
  for (int i = 1; i <= m; ++i) {
    int l, r;
    scanf("%d%d", &l, &r);
    puts(go(l, r) == r + 1 ? "Yes" : "No");
  }
  return 0;
}
