There are n clocks in the Pradnya Planet which beep after different time periods.
The clocks are represented as C₁, C₂, ... C_n and their respective time periods by T₁, T₂, T₃, ... T_n.
Each clock beeps with the intensity of 1. If k clocks beep at the same time, it is counted as one beep of intensity k.
There are p aliens in the pradnya world who are sleeping at time t=0.
These p aliens are denoted by A₁, A₂, ... A_p.
All the aliens are insomniac but all in a different way.
An alien wakes up at time t, either if the number of beeps completed before or at the time t exceeds a particular value(Beep Value), or if the intensity of any beep before or at time t exceeds a particular value(Intensity Value).
Now, the aliens go to their "Big Boss" with a time t.
The "Big Boss" then tells whether the alien will wake up till that time t.
Since the queries(q) of the aliens are too large, help the "Big Boss" to answer the queries.

Note: A clock C_i with time period T_i beeps at time: T_i, 2T_i, 3T_i, ... so on.

Input Format:
The first line contains an integer n denoting the number of clocks.

The next line contains n space separated integers denoting the time periods of the n respective clocks.

The next line contains p denoting the number of aliens.

The next p lines contain two space separated integers b and i, denoting the Beep Value and Intensity Value of the respective aliens

The next line contains q denoting the number of queries.

The next q lines contain two space separated integers in and t, denoting the alien A_in and the time t respectively.

Output Format:
For each of the q lines, output "Awake" if the alien A_in will awake before time t,
else output "Asleep", if the alien does not wake up before time t.

Constraints:
1 <= n <= 10⁵
1 <= time period of any clock <= 10³
1 <= p <= 10³
1 <= q <= 10⁵
1 <= i <= n
1 <= t <= 10⁵
1 <= b <= t