//AC
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<queue>
#include<iostream>
#include<algorithm>
using namespace std;
long long t,n,k,m[11]={0,9,99,999,9999,99999,999999,9999999,99999999,999999999,9999999999};
int main()
{
	scanf("%lld",&t);
	for (int i=1;i<=t;i++)
	{
		scanf("%lld",&k);
		scanf("%lld",&n);
		if (n%m[k]==0)	{cout<<"aya"<<endl;}
		else	{cout<<"baka"<<endl;}
	}
	return 0;
}

//50分
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<queue>
#include<iostream>
#include<algorithm>
using namespace std;
long long t,n,k,m;
int main()
{
	scanf("%lld",&t);
	for (int i=1;i<=t;i++)
	{
		scanf("%lld",&k);
		scanf("%lld",&n);
		m=10*k-1;
		if (n%m==0)	{cout<<"aya"<<endl;}
		else	{cout<<"baka"<<endl;}
	}
	return 0;
}