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

#define fi first
#define se second
#define pb push_back
#define Mp make_pair
#define SZ(x) (int((x).size()))

typedef double db;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

const int MAXN = 4e5 + 5;

int n, m, a[MAXN], cnt;

int last[256], sta[256];
int val[256];

void upd() {
    sort(val, val + 256, [](int x, int y) {return last[x] < last[y];});
    for(int i = 255; i >= 0; i--) {
        int flg = 0;
        for(int j = 1; j < 256; j <<= 1) {
            int p = i ^ j;
            if(last[p] > last[i] && !sta[p]) flg = 1;
        }
        sta[i] = flg;
    }
}
void add(int x) {
    ++cnt, last[x] = cnt, sta[x] = 0, a[cnt] = x;
}

void solve() {
    for(int i = 0; i < 256; i++) val[i] = i;
    cin >> n >> m;
    for(int i = 1, x; i <= n; i++) {
        cin >> x, add(x); 
    }
    upd();
    for(int i = 1; i <= m; i++) {
        int opt, k;
        cin >> opt >> k;
        if(opt == 1) add(k), upd();
        else if(opt == 2) {
            if(last[a[k]] != k) {
                cout << "Grammy\n";
            } else if(sta[a[k]]) {
                cout << "Grammy\n";
            } else {
                cout << "Alice\n";
            }
        }
    }
}

signed main() {
    ios::sync_with_stdio(false), cin.tie(0);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}