#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for(ll i=a;i<=b;i++)
#define wt int tt=d;while(tt--)
#define py puts("Annapurna")
#define pn puts("Brahma")
#define fe(i,e) for(int i=0;i<e.size();i++)
#define vi vector<ll>
inline ll rd() {
	ll x=0,f=1;
	char c=getchar();
	while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
	while(isdigit(c))x=x*10+c-'0',c=getchar();
	return x*f;
}
namespace binom{
	const ll Lim=300010,mod=998244353;
	ll jc[Lim],inv[Lim],inc[Lim];
	void pre(){
		jc[0]=jc[1]=inc[0]=inc[1]=inv[0]=inv[1]=1;
		f(i,2,Lim-1)jc[i]=jc[i-1]*i%mod,inv[i]=(mod-mod/i)*inv[mod%i]%mod,
		inc[i]=inc[i-1]*inv[i]%mod;
	}ll C(ll n,ll m){if(n<0||m<0||n<m)return 0;return jc[n]*inc[m]%mod*inc[n-m]%mod;}
}
// using namespace binom;
ll dx[8]={1,1,-1,-1,2,2,-2,-2};
ll dy[8]={2,-2,2,-2,1,-1,1,-1};
#define d rd()
#define pb push_back
const ll N=300010;
struct edge{ll v,w,nx;}e[N<<1];
ll hd[N],cnt;
void add(ll u,ll v,ll w){e[++cnt]=(edge){v,w,hd[u]};hd[u]=cnt;}
ll qp(ll a,ll b,ll p){
	ll ans=1;while(b){
		if(b&1)ans=ans*a%p;
		a=a*a%p;b>>=1;
	}return ans;
}ll n,m,sx,sy;
bool vis[110][110];

ll sg(ll x,ll y){
    ll res=0;
    f(i,0,7){
        ll xx=x+dx[i],yy=y+dy[i];
        if(xx<=0||yy<=0||xx>n||yy>m||vis[xx][yy])continue;
        vis[xx][yy]=1;
        if(sg(xx,yy)==0)res=1;
        vis[xx][yy]=0;
    }return res;
}
void solve(){
    n=d,m=d;ll x=d,y=d;
    if(n>m)swap(n,m),swap(x,y);
    if(n==1){pn;return;}
    if(n==2){
        if(m%4==1){if(x%4==1)pn;else py;}
        if(m%4==2){if(x%4==1||x%4==2)pn;else py;}
        if(m%4==3){if(x%4==2)pn;else py;}
        return;
    }
    if(n%2==0||m%2==0){py;return;}
    if(n==3&&m==3){
        if(x==2&&y==2)pn;
        else py;return;
    }if(n==3&&m==5){
        if((x+y)%2==1||y==3)py;
        else pn;return;
    }
    if((x+y)%2==0)pn;else py;
}
int main(){
    // n=d,m=d;
    // f(i,1,n){
    //     f(j,1,m){
    //         memset(vis,0,sizeof(vis));
    //         vis[i][j]=1;cout<<sg(i,j);
    //     }cout<<endl;
    // }
    wt solve();
	return 0;
}