#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()


void solve ( ) {
    ll n , m , x , y ;
    cin >> n >> m >> x >> y ;
    if ( n > m ) { swap ( n , m ) , swap ( x , y ) ; }
    if ( n == 1 ) {
        cout << "Bob\n" ;
        return ;
    }
    if ( n == 2 ) {
        int lenl = ( y - 1 ) / 2 + 1 , lenr = 1 + ( m - y ) / 2 ;
        if ( ( lenl % 2 ) == 0 || ( lenr % 2 ) == 0 ) {
            cout << "Alice\n" ;
        }
        else {
            cout << "Bob\n" ;
        }
        return ;
    }
    if ( ( n % 2 ) == 0 || ( m % 2 ) == 0 ) {
        cout << "Alice\n" ;
        return ;
    }
    if ( n == 3 && m == 3 ) {
        if ( x == 2 && y == 2 ) {
            cout << "Bob\n" ;
        }
        else {
            cout << "Alice\n" ;
        }
        return ;
    }
    if ( ( x + y ) % 2 == 0 ) {
        cout << "Bob\n" ;
    }
    else {
        cout << "Alice\n" ;
    }
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}