#include <bits/stdc++.h>
using namespace std;
const int maxn = 200007;
string s;
int q, n, cnt[maxn][26];
void Solve() {
  int l, r;
  cin >> l >> r;
  if (l == r) {
    cout << "Yes" << '\n';
    return;
  }
  if (s[l] != s[r]) {
    cout << "Yes" << '\n';
    return;
  }
  int cnt = 0;
  for (int i = 0; i < 26; i++) {
    if (i == s[l] - 'a') continue;
    int gau = ::cnt[r][i] - ::cnt[l - 1][i];
    if (gau) cnt++;
  }
  if (cnt >= 2)
    cout << "Yes" << '\n';
  else
    cout << "No" << '\n';
}
int32_t main() {
  auto start = chrono::steady_clock::now();
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  if (fopen("test.inp", "r")) freopen("test.inp", "r", stdin);
  cin >> s >> q;
  n = s.length();
  s = ' ' + s;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < 26; j++) {
      cnt[i][j] = cnt[i - 1][j];
      if (j == s[i] - 'a') cnt[i][j]++;
    }
  }
  while (q--) Solve();
  auto finish = chrono::steady_clock::now();
  cerr << chrono::duration_cast<chrono::milliseconds>(finish - start).count();
}
