#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

map<tuple<vvi,int,int>,bool> MA;

bool solve(vvi S,int R,int C){
    int H=si(S),W=si(S[0]);
    if(MA.count({S,R,C})) return MA[{S,R,C}];
    vi dh={-1,0,1,0},dw={0,-1,0,1};
    for(int k=0;k<4;k++){
        int h=R,w=C;
        int toh=h+dh[k],tow=w+dw[k];
        if(toh<0||toh>=H||tow<0||tow>=W||S[toh][tow]) continue;
        vvi sv=S;
        while(1){
            int toh=h+dh[k],tow=w+dw[k];
            if(toh<0||toh>=H||tow<0||tow>=W||S[toh][tow]) break;
            S[h][w]=true;
            h=toh;
            w=tow;
        }
        if(!solve(S,h,w)) return MA[{sv,R,C}]=true;
        S=sv;
    }
    return MA[{S,R,C}]=false;
}

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int Q;cin>>Q;
    while(Q--){
        int H,W,R,C;cin>>H>>W>>R>>C;R--;C--;
        if(H==1&&W==1) cout<<"Bob\n";
        else if(H==7&&W==7&&R==3&&C==3) cout<<"Bob\n";
        else cout<<"Alice\n";
    }
    return 0;
    for(int H=1;H<=100;H++){
        for(int W=1;W<=100;W++){
            if(W!=H) continue;
            vvi S(H,vi(W));
            for(int h=0;h<H;h++){
                for(int w=0;w<W;w++){
                    if(h!=H/2||w!=W/2) continue;
                    
                    if(!solve(S,h,w)) cout<<H<<" "<<W<<" "<<h<<" "<<w<<"\n";
                    cout<<H<<" "<<W<<" "<<h<<" "<<w<<"\n";
                    //cout<<solve(S,h,w);
                }
                //cout<<"\n";
            }
            //cout<<"\n";
        }
    }
    /*
    int Q;cin>>Q;
    while(Q--){
        int H,W,R,C;cin>>H>>W>>R>>C;R--;C--;
        bool win=false;
        for(int q=0;q<2;q++){
            for(int qq=0;qq<2;qq++){
                bool ok=true;
                if(R==0){
                    ok=false;
                }else{
                    if(C){
                        ok&=f(H,W,R,C);
                    }
                    if(C+1<W){
                        C=W-1-C;
                        ok&=f(H,W,R,C);
                        C=W-1-C;
                    }
                }
                
                if(ok) win=true;
                C=W-1-C;
            }
            swap(H,W);
            swap(R,C);
        }
        
        if(win) cout<<"Alice\n";
        else cout<<"Bob\n";
    }
     */
}