#include<bits/stdc++.h>
using namespace std;

void solve(){
  vector<int> dy={1,0,-1,0},dx={0,1,0,-1};
  int h,w,r,c;
  cin>>h>>w>>r>>c;
  vector<string> s(h+2,string(w+2,'#'));
  for (int i=1;i<=h;i++) for (int j=1;j<=w;j++) s[i][j]='.';
  vector<pair<int,int>> vp={{r,c}};
  auto f=[&](int i,int j,int dir){
    while (true){
      int ni=i+dy[dir],nj=j+dx[dir];
      if (s[ni][nj]=='#') return;
      vp.push_back({ni,nj});
      s[i][j]='#';
      i=ni;j=nj;
    }
  };
  auto rec=[&](auto rec,int i,int j,int t)-> int {
    int ret=0;
    for (int dir=0;dir<4;dir++){
      if (s[i+dy[dir]][j+dx[dir]]=='#') continue;
      f(i,j,dir);
      auto [ni,nj]=vp.back();
      ret|=rec(rec,ni,nj,t^1)!=t;
      while (vp.back()!=pair{i,j}){
        auto [i2,j2]=vp.back();
        s[i2][j2]='.';
        vp.pop_back();
      }
    }
    return ret^t;
  };
  int ans=rec(rec,r,c,0);
  if (ans) cout<<"Alice\n";
  else cout<<"Bob\n";
}

int main(){
  int t;
  cin>>t;
  while (t--) solve();
}