#include<iostream>

#include<cstdio>

#include<algorithm>

#include<string>

#include<cstring>

#include<cmath>

#include<set>

#include<vector>

#include<list>

using namespace std;

typedef long long ll;

typedef pair<double,double>ppd;

const double PI = acos(-1.);

const double eps = (1e-9);

const int MOD=10007;

const int N=105;

int a[N][N];

int c[N][N];

int lowbit(int x)

{

    return x&(-x);

}

void add(int x,int y)

{

    for(int i=x;i<N;i=i+lowbit(i))

    for(int j=y;j<N;j=j+lowbit(j))

    ++c[i][j];

}

int get(int x,int y)

{

    int tmp=0;

    for(int i=x;i>=1;i=i-lowbit(i))

    for(int j=y;j>=1;j=j-lowbit(j))

    tmp+=c[i][j];

    return tmp;

}

int main()

{

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

    int T;

    scanf("%d",&T);

    for(int ca=1;ca<=T;++ca)

    {

        memset(c,0,sizeof(c));

        memset(a,0,sizeof(a));

        int n,m;

        scanf("%d %d",&n,&m);

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

        for(int j=1;j<=m;++j)

        scanf("%d",&a[i][j]);

        int ans=0;

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

        {

            for(int x=i,y=1;x>=1&&y<=m;--x,++y)

            if((a[x][y]+get(x,y))&1)

            {

                ++ans;

                add(x,y);

            }

        }

        for(int j=2;j<=m;++j)

        {

            for(int x=n,y=j;x>=1&&y<=m;--x,++y)

            if((a[x][y]+get(x,y))&1)

            {

                ++ans;

                add(x,y);

            }

        }

        if((ans&1))

        printf("Alice\n");

        else

        printf("Bob\n");

    }

    return 0;

}