//Author: RingweEH
#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
#define db double
using namespace std;
int min( int a,int b ) { return a<b ? a : b; }
int max( int a,int b ) { return a>b ? a : b; }
void bmax( int &a,int b ) { a=(a>b) ? a : b; }
void bmin( int &a,int b ) { a=(a<b) ? a : b; }
const int L=1<<20;
char buf[L],*p1,*p2;
#define getchar() (p1==p2?(p2=buf+fread(p1=buf,1,L,stdin),p1==p2?EOF:*p1++):*p1++)
int read()
{
    int x=0,w=1; char ch=getchar();
    while ( ch>'9' || ch<'0' ) { if ( ch=='-' ) w=-1; ch=getchar(); }
    while ( ch<='9' && ch>='0' ) x=x*10+ch-'0',ch=getchar();
    return x*w;
}

const int N=110;
int n,m,a[N+N];

int main()
{
//freopen( "exam.in","r",stdin );

	int T=read();
	while ( T-- )
	{
		memset( a,0,sizeof(a) );
		n=read(); m=read();
		for ( int i=1; i<=n; i++ )
			for ( int j=1; j<=m; j++ )
				a[i+j]^=read();
		
		bool fl=1;
		for ( int i=2; i<=n+m; i++ )
			fl&=(a[i]==0);
		
		if ( fl ) puts("Jeel");
		else puts("Ashish");
	}

	return 0;
}

