#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007

int N, Q;
string S;
int F[27][500001];
int G[20][500001];

signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> S >> Q;
  N = S.length();
  rep(i, 27) rep(j, N+1) F[i][j] = INF;
  rep(i, N) F[S[i]-'a'][i] = i+1;
  for (int i=N; i>=0; i--) {
    rep(k, 26) if (F[k][i] != INF) F[k+1][i] = min(F[k+1][i], F[k][F[k][i]]);
    if (F[26][i] == INF) continue;
    rep(k, 26) F[k][i] = min(F[k][i], F[k][F[26][i]]);
    rep(k, 26) if (F[k][i] != INF) F[k+1][i] = min(F[k+1][i], F[k][F[k][i]]);
  }
  rep(i, 20) rep(j, N+1) G[i][j] = INF;
  rep(i, N+1) G[0][i] = F[26][i];
  rep(k, 19) {
    rep(i, N+1) {
      if (G[k][i] == INF) G[k+1][i] = INF;
      else G[k+1][i] = G[k][G[k][i]];
    }
  }

  rep(i, Q) {
    int l, r;
    cin >> l >> r;
    l--;
    for (int k=19; k>=0; k--) if (G[k][l] <= r) l = G[k][l];
    if (l == r) cout << "Yes\n";
    else cout << "No\n";
  }
  return 0;
}
