/*

Author: Haze

2024/9/5

*/

#include <bits/stdc++.h>

#define irep(i, l, r) for(int i = (l); i <= (r); ++ i)
#define drep(i, r, l) for(int i = (r); i >= (l); -- i)
#define IOS ios::sync_with_stdio(false), cin.tie(nullptr);
using namespace std;
typedef long long ll;

inline ll readL() {
    ll s = 0;
    bool fl = false;
    char ch = (char) getchar();
    while (!isdigit(ch)) {
        if (ch == '-')fl = true;
        ch = (char) getchar();
    }
    while (isdigit(ch)) {
        s = s * 10 + (ch ^ 48);
        ch = (char) getchar();
    }
    return fl ? -s : s;
}

inline int read() {
    return (int) (readL());
}

const int mod = 1000000000 + 7;
const int itinf = 1000000999;
const ll llinf = 2e18;
const int N = 500099;

int popcount(int x){
    if(x)return 1 + popcount(x - (x & -x));
    return 0;
}

void solve() {
    int n = read(), m = read();
    vector<array<int, 2>>qr;
    vector<int>pos[256], t;
    irep(i, 0, n - 1){
        int x = read();
        pos[x].push_back(i);
        t.push_back(x);
    }
    irep(isd, 0, m - 1){
        int op = read();
        if(op == 1){
            int k = read();
            pos[k].push_back(n ++);
            t.push_back(k);
        }
        else{
            int p = read() - 1, v = t[p], L = 0;
            vector<array<int, 2>>a;
            irep(i, 0, 255){
                auto it = upper_bound(pos[i].begin(), pos[i].end(), p);
                if(it != pos[i].end())a.push_back({*it, i});
            }
            sort(a.begin(), a.end());
            vector<int>usd(256);
            vector<int>wl(256);
//            for(auto [pp, ppp] : a)cerr << ppp << ' ';
//            cerr << endl;
            drep(i, a.size() - 1, 0){
                int val = a[i][1], ok = 0, flag = 0;
                for(int b = 1; b < 256; b <<= 1){
                    if(usd[b ^ val]){
                        ok = 1;
                        if(wl[b ^ val] == 0){
                            flag = 1;
                            break;
                        }
                    }
                }
                if(flag)wl[val] = 1;
                else wl[val] = 0;
                usd[val] = 1;
//                cerr << v << ' ' << val << ' ' << wl[val] << endl;
                if(popcount(val ^ v) <= 1 && wl[val] == 0){
                    L = 1;
                    break;
                }
            }
            cout << (L ? "Grammy" : "Alice") << '\n';
        }
    }
}

int main() {
    // IOS
    int T = 1;
    while (T--) {
        solve();
    }
    return 0;
}