Grammy is playing a game with her roommate Alice on a sequence $$$A$$$ with $$$n$$$ non-negative integers $$$A_1,A_2,\dots,A_n$$$. The rules of the game are described as follows.
They play this game many times and the sequence can be modified many times. Grammy wants to ask you for some initial states who will win the game if both play optimally.
The first line of input contains 2 integers $$$n$$$ and $$$m$$$ ($$$1\leq n,m\leq 200\,000$$$), denoting the length of the sequence and the number of operations.
The second line contains $$$n$$$ integers $$$A_1,A_2,\dots,A_n$$$ ($$$0\leq A_i\leq 255$$$), denoting the sequence $$$A$$$.
The next $$$m$$$ lines each contains 2 integers $$$op$$$ ($$$1\leq op\leq 2$$$) and $$$k$$$, denoting each operation:
For each operation with $$$op=2$$$, output one line containing "Grammy" if Grammy will win, or "Alice" if Alice will win when they play optimally.
5 5 1 2 3 4 5 1 6 2 5 1 7 2 5 2 1
Alice Grammy Alice
| Name |
|---|


