Light OJ 1247 / Game Theory

/***
 created: 2023-01-11-23.19.07
***/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename U> using ordered_set=tree<U, null_type,less<U>,rb_tree_tag,tree_order_statistics_node_update>;
#define ll long long
#define all(we) we.begin(),we.end()
#define test int tt; cin>>tt; for(int cs=1;cs<=tt;cs++)
#define nl '\n'

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    test
    {
        ll n,m,i,j,k=0,l=0;
        cin>>n>>m;
        for(i=1;i<=n*m;i++)
        {
            cin>>j;
            k+=j;
            if(i%m==0)
            {
                l^=k;
                k=0;
            }
        }
        if(l) cout<<"Case "<<cs<<": Alice"<<nl;
        else cout<<"Case "<<cs<<": Bob"<<nl;
    }
    return 0;
}