#include <bits/stdc++.h>
using namespace std;

const int N = 2e5,K=255;
int n,m,a[(N<<1)+10],pos[K+10],f[K+10],ls[K+10],nx[K+10],tp,lst,fl;
int op,k;
int Calc(int x){
	for(int i=0;i<8;++i)if(pos[x^(1<<i)]>pos[x]&&!f[x^(1<<i)])return 1;
	return 0;
}
int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin>>n>>m;
	for(int i=1;i<=n;++i)cin>>a[i];
	for(int i=n;i>=1;--i)if(!pos[a[i]]){
		pos[a[i]]=i;
		if(!tp)tp=a[i],nx[a[i]]=K+1,ls[K+1]=a[i];
		else ls[lst]=a[i],nx[a[i]]=lst;
		f[a[i]]=Calc(a[i]);
		lst=a[i];
	}
	ls[lst]=K+2,nx[K+2]=lst;
	while(m--){
		cin>>op>>k;
		if(op==1){
			f[k]=0;
			if(pos[k]){
				ls[nx[k]]=ls[k],nx[ls[k]]=nx[k];
				if(tp==k)tp=ls[k];
			}
			pos[k]=++n,a[n]=k;
			for(int t=tp;t<=K;t=ls[t])f[t]=Calc(t);
			ls[k]=tp,nx[tp]=k,tp=k;
			//for(int i=1;i<=n;++i)cout<<a[i]<<" \n"[i==n];
			//for(int i=tp;i<=K;i=ls[i])cout<<"("<<i<<","<<f[i]<<")\n";
		}else{
			fl=0;
			if(pos[a[k]]==k)fl=f[a[k]];
			else{
				fl=(f[a[k]]^1);
				for(int i=0;i<8&&!fl;++i)if(pos[a[k]^(1<<i)]>k&&!f[a[k]^(1<<i)])fl=1;
			}
			cout<<(fl?"Grammy":"Alice")<<"\n";
		}
	}
}
/*
5 5
1 2 3 4 5
1 6
2 5
1 7
2 5
2 1

9 12
1 1 1 2 2 2 3 3 3
1 1
2 1
2 4
2 7
1 2
2 1
2 4
2 7
1 3
2 1
2 4
2 7


*/