#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
const int mod = 1e9 + 7;
const long double Pi = acos(-1.0);
using ll = long long;
using ii = pair<int, int>;
const int N = 1e5 + 5;
string str;
int n;
int prv[N][26], nxt[N][26];
int grundy[N], dp[N][26];
int mem[27];
int solve(int l, int r, int c, bool f) {
  if (l > r) return 0;
  if (~mem[c]) return mem[c];
  int mask = 0;
  for (int i = 0; i < 26; i++) {
    int a = nxt[l][i], b = prv[r][i];
    if (b >= l) {
      int val = grundy[b] ^ grundy[a];
      if (f) {
        val ^= dp[r][i] ^ solve(l, a - 1, i, 1);
      } else {
        val ^= dp[a - 1][c] ^ solve(b + 1, r, i, 0);
      }
      mask |= (1 << val);
    }
  }
  mem[c] = 26;
  for (int i = 0; i < 26; i++)
    if (mask >> i & 1 ^ 1) {
      mem[c] = i;
      break;
    }
  return mem[c];
}
int main(int argc, char** argv) {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> str;
  int n = str.size();
  str = "#" + str;
  for (int i = 1; i <= n; i++) {
    str[i] -= 'a';
    for (int j = 0; j < 26; j++) {
      prv[i][j] = prv[i - 1][j];
    }
    prv[i][str[i]] = i;
  }
  for (int i = 0; i < 26; i++) nxt[n + 1][i] = n + 1;
  for (int i = n; i >= 1; --i) {
    for (int j = 0; j < 26; j++) nxt[i][j] = nxt[i + 1][j];
    nxt[i][str[i]] = i;
  }
  for (int i = 1; i <= n; i++) {
    grundy[i] = grundy[prv[i - 1][str[i]]] ^ dp[i - 1][str[i]];
    memset(mem, -1, sizeof mem);
    for (int j = 0; j < 26; j++) dp[i][j] = solve(prv[i][j] + 1, i, j, 0);
  }
  int q;
  cin >> q;
  while (q--) {
    int l, r;
    cin >> l >> r;
    memset(mem, -1, sizeof mem);
    cout << (solve(l, r, 26, 1) ? "Alice\n" : "Bob\n");
  }
  return 0;
}
