#include<bits/stdc++.h>

 using namespace std;

 const int maxn= ;

 int n,q;

 char str[maxn];

 int pre[][maxn],suf[][maxn];

 int arr[][maxn],ar[][maxn];

 int Pf[][maxn],Sf[][maxn];

 int solve(int,int,int);

 int hd(int k,int l,int r,int dep){

     if(ar[k][l]) return Sf[k][l];

     else {

         ar[k][l]=,Sf[k][l] = solve(l,r,dep+);

         return Sf[k][l];

     }

 }

 int pd(int k,int r,int l,int dep){

     if(arr[k][r]) return Pf[k][r];

     else{

         arr[k][r] = ,Pf[k][r] = solve(l,r,dep+);

         return Pf[k][r];

     }

 }

 int app[maxn][];

 int solve(int l,int r,int dep){

     if(l > r) return ;

     if(l == r) return ;

     for(int k=;k<=;k++) app[dep][k] = ;

     for(int k=;k<;k++){

         int pv = suf[k][l],sv = pre[k][r];

         if(pv > r || sv < l || pv == - || sv == -) continue;

         int ans = Pf[k][sv]^Pf[k][pv];

         if(pre[k][r] != r) ans ^= pd(k,r,sv+,dep);

         if(suf[k][l] != l) ans ^= hd(k,l,pv-,dep);

         app[dep][ans] = ;

     }

     for(int i=;i<=;i++) if(app[dep][i] == ) return i;

 }

 void init(){

     for(int i=;i<n;i++){

         if(i->=&&pre[str[i]-'a'][i-]!=-){

             int k = str[i]-'a';

             if(pre[k][i-]+>i-) Pf[k][i]=Pf[k][pre[k][i-]];

             else Pf[k][i]=Pf[k][pre[k][i-]]^Pf[k][i-];

             arr[k][i] = ;

         }

         for(int k=;k<;k++){

             if(pre[k][i] == -) continue;

             if(arr[k][i]) continue;

             if(pre[k][i] != i) Pf[k][i] = solve(pre[k][i]+,i,);

             arr[k][i] = ;

         }

     }

     for(int i=n-;i>=;i--){

         if(i+<n&&suf[str[i]-'a'][i+]!=-){

             int k = str[i]-'a';

             if(i+ > suf[k][i+]-) Sf[k][i]=Sf[k][suf[k][i+]];

             else Sf[k][i]=Sf[k][suf[k][i+]]^Sf[k][i+];

             ar[k][i] = ;

         }

         for(int k=;k<;k++){

             if(suf[k][i] == -) continue;

             if(ar[k][i]) continue;

             if(suf[k][i] != i) Sf[k][i] = solve(i,suf[k][i]-,);

             ar[k][i] = ;

         }

     }

 }

 void read(){

     scanf("%s",str);

     scanf("%d",&q);

     n = strlen(str);

     for(int k=;k<;k++){for(int i=;i<n;i++) pre[k][i] = suf[k][i] = -;}

     for(int i=;i<n;i++)pre[str[i]-'a'][i] = i,suf[str[i]-'a'][i] = i;

     for(int k=;k<;k++){

         for(int i=;i<n;i++) if(pre[k][i]==-) pre[k][i] = pre[k][i-];

         for(int i=n-;i>=;i--) if(suf[k][i]==-) suf[k][i] = suf[k][i+];

     }

 }

 void work(){

     for(int i=;i<=q;i++){

         int l,r; scanf("%d%d",&l,&r);

         int flag = solve(l-,r-,);

         if(flag) puts("Alice");

         else puts("Bob");

     }

 }

 int main(){

     //freopen("1.in","r",stdin);

     //freopen("1.out","w",stdout);

     read();

     init();

     work();

     return ;

 }