#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O2")
constexpr int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, 1, -1};
constexpr long long INF = 1999999999999999997;
constexpr int inf = INT_MAX;
constexpr int MAXSIZE = int(1e6) + 5;
constexpr auto PI = 3.14159265358979323846L;
constexpr auto oo = numeric_limits<int>::max() / 2 - 2;
constexpr auto eps = 1e-6;
constexpr auto mod = 1000000007;
constexpr auto MOD = 1000000007;
constexpr auto MOD9 = 1000000009;
constexpr auto maxn = 100006;
void fastio() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
}
int fenwick[26][300005];
void update(int ind, int val, int type) {
  for (int i = ind; i <= 200003; i += (i & (-i))) {
    fenwick[type][i] += val;
  }
}
int query(int ind, int type) {
  int sum = 0;
  for (int i = ind; i >= 1; i -= (i & (-i))) {
    sum += fenwick[type][i];
  }
  return sum;
}
int main() {
  fastio();
  string s;
  cin >> s;
  s = '*' + s;
  int n = s.length();
  for (int i = 1; i < n; i++) {
    int l = s[i] - 'a';
    update(i, 1, l);
  }
  int q;
  cin >> q;
  for (int p = 0; p < q; p++) {
    int a, b;
    cin >> a >> b;
    int cnt = 0;
    for (int i = 0; i < 26; i++) {
      int m = query(b, i) - query(a - 1, i);
      if (m > 0) {
        cnt++;
      }
    }
    if (cnt >= 3 || (b == a) || s[a] != s[b]) {
      cout << "Yes\n";
    } else {
      cout << "No\n";
    }
  }
}
