#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int M = 2e3 + 5;
const int INF = 0x7fffffff;
const int mod = 998244353;
const double eps = 1e-8;
const double pi = acos(-1);
int n, m;
char str[N];
int f[N][26];
template <class T>
inline void read(T &x) {
  char c;
  x = 1;
  while ((c = getchar()) < '0' || c > '9')
    if (c == '-') x = -1;
  T res = c - '0';
  while ((c = getchar()) >= '0' && c <= '9') res = res * 10 + c - '0';
  x *= res;
}
int main() {
  scanf("%s", str + 1);
  read(n);
  int len = strlen(str + 1);
  for (int i = 1; i <= len; i++) {
    for (int j = 0; j <= 25; j++) {
      if (str[i] - 'a' == j)
        f[i][j] = f[i - 1][j] + 1;
      else
        f[i][j] = f[i - 1][j];
    }
  }
  while (n--) {
    int l, r;
    read(l);
    read(r);
    int cnt = 0;
    for (int i = 0; i <= 25; i++) {
      if (f[r][i] - f[l - 1][i] > 0) cnt++;
    }
    if ((cnt >= 3) || (l == r) || (str[l] != str[r]))
      cout << "Yes\n";
    else
      cout << "No\n";
  }
  return 0;
}
