#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second 

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int LOG = 8;
const int M = 1 << LOG;

int lastPos[M];
int win[M];

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	fill(lastPos, lastPos + M, -1);
	int n, m;
	cin >> n >> m;
	VI a(n);
	FOR(i, 0, n)
	{
		cin >> a[i];
		lastPos[a[i]] = i;
	}
	set<PII> s;
	FOR(x, 0, M)
	{
		if (lastPos[x] != -1)
		{
			s.insert({-lastPos[x], x});
		}
	}
	auto calcWin = [&]()
	{
		fill(win, win + M, -1);
		for (auto [i, x] : s)
		{
			if (win[x] != -1)
			{
				assert(win[x] == 1);
				continue;
			}
			win[x] = 0;
			FOR(j, 0, LOG)
			{
				win[x ^ (1 << j)] = 1;
			}
		}
	};
	calcWin();
	while (m--)
	{
		int op, k;
		cin >> op >> k;
		if (op == 1)
		{
			if (lastPos[k] != -1)
			{
				s.erase({-lastPos[k], k});
			}
			a.PB(k);
			lastPos[k] = n++;
			s.insert({-lastPos[k], k});
			calcWin();
		}
		else
		{
			k--;
			int x = a[k];
			assert(win[x] != -1);
			cout << (win[x] == 1 || k != lastPos[x] ? "Grammy\n" : "Alice\n");
		}
	}
	return 0;
}