#include <bits/stdc++.h>
using namespace std;
template <class T>
bool uin(T &a, T b) {
  return a > b ? (a = b, true) : false;
}
template <class T>
bool uax(T &a, T b) {
  return a < b ? (a = b, true) : false;
}
class segtree {
 public:
  int size;
  vector<vector<int>> tree;
  void init(int n) {
    size = 1;
    while (size < n) size *= 2;
    tree.assign(4 * size, vector<int>(27, 0));
  }
  vector<int> merge(vector<int> a, vector<int> b) {
    for (int i = 0; i < 27; ++i) {
      if (b[i] >= 1) a[i] = 1;
    }
    return a;
  }
  void build(vector<int> &arr, int lx, int rx, int x) {
    if (rx - lx == 1) {
      if (lx < arr.size()) {
        tree[x][arr[lx]] = 1;
      }
      return;
    }
    int m = (lx + rx) / 2;
    build(arr, lx, m, 2 * x + 1);
    build(arr, m, rx, 2 * x + 2);
    tree[x] = merge(tree[2 * x + 1], tree[2 * x + 2]);
  }
  void build(vector<int> &arr) { return build(arr, 0, size, 0); }
  vector<int> query(int x, int lx, int rx, int l, int r) {
    if (l <= lx && r >= rx) return tree[x];
    if (rx <= l || lx >= r) return vector<int>(27, 0);
    int m = (lx + rx) / 2;
    vector<int> l1 = query(2 * x + 1, lx, m, l, r);
    vector<int> r1 = query(2 * x + 2, m, rx, l, r);
    return merge(l1, r1);
  }
  vector<int> calc(int l, int r) { return query(0, 0, size, l, r); }
};
void solve() {
  string s;
  cin >> s;
  int n = s.size();
  vector<int> arr;
  for (auto &i : s) arr.push_back((int)(i - 'a'));
  segtree st;
  st.init(n + 1);
  st.build(arr);
  int q;
  cin >> q;
  while (q--) {
    int l, r;
    cin >> l >> r;
    --l;
    --r;
    if (l == r) {
      cout << "Yes" << '\n';
      continue;
    }
    vector<int> x = st.calc(l, r + 1);
    int cnt = 0;
    for (int i = 0; i < 26; ++i) {
      if (x[i] >= 1) ++cnt;
    }
    if (cnt == 2) {
      if (s[l] == s[r] && r - l + 1 >= 3) {
        cout << "No" << '\n';
      } else
        cout << "Yes" << '\n';
      continue;
    }
    cout << (cnt <= 1 ? "No" : "Yes") << '\n';
  }
}
signed main() {
  cin.tie(NULL), ios_base::sync_with_stdio(false), cout.tie(NULL);
  int t = 1;
  while (t--) solve();
  return 0;
}
