Mirko and Slavko are spending their free time playing with polygons and watching a new season of The Biggest Loser. Mirko recently drew a convex polygon with an even number of vertices ~N~. Slavko then considered each pair of opposite sides (two sides are opposite if there are ~\frac{N}{2} - 1~ sides between them), drew straight lines that lie on those sides and colored them along with the part of the plane that lies between them and contains the polygon. Finally, Mirko found a set of ~Q~ points and decided to challenge Slavko to answer for each point whether it lies in the colored or uncolored part of the plane.

The new episode of The Biggest Loser is about to start and Slavko doesn't have the time to answer Mirko's queries. Can you help him?

Input

The first line contains an integer ~T~ which is used as a parameter for generating Mirko's queries. This number can be either ~0~ or ~1~.

The second line contains an even integer ~N~ from the task description.

Each of the next ~N~ lines contains two integers ~X_i, Y_i~ ~(0 \le |X_i|, |Y_i| \le 10^9)~ which represent one of the polygon's vertices. You can assume that the vertices are given in counter-clockwise order and that no three successive vertices are collinear.

The next line contains an integer ~Q~ from the task description.

Each of the next ~Q~ lines contains two integers ~A_i, B_i~ ~(0 \le |A_i|, |B_i| \le 2 \cdot 10^{18})~ which are used as parameters for generating the point in the ~i~-th of Mirko's queries.

Let ~X_i~ be equal to the number of points in the first ~i~ (inclusive) of Mirko's queries that lie in the colored part of the plane. Naturally, ~X_0 = 0~. The point of Mirko's ~i~-th query should then be generated as:

$$\displaystyle P_i = \left(A_i \oplus (T \cdot X_{i-1}^3), B_i \oplus (T \cdot X_{i-1}^3)\right)$$

where ~\oplus~ represents the bitwise xor operation.

Output

The ~i~-th line of output should contain the word DA (YES in Croatian) if the point from ~i~-th of Mirko's queries lies in the colored part of the plane. Otherwise, the ~i~-th line should contain the word NE (NO in Croatian).

Scoring

Subtask	Score	Constraints
~1~	~20~	~1 \le N,Q \le 2\,000, T = 0~
~2~	~30~	~1 \le N,Q \le 10^5, T = 0~
~3~	~60~	~1 \le N,Q \le 10^5, T = 1~

Sample Input 1

0
4
1 1
5 1
4 3
2 2
4
3 2
2 4
6 2
4 5

Sample Output 1

DA
NE
DA
NE

Sample Input 2

0
6
-1 -1
2 -1
3 3
2 4
1 4
-2 1
6
2 2
3 0
1 -6
2 6
-5 5
5 10

Sample Output 2

DA
DA
NE
NE
NE
NE

Explanation for Sample Output 2

Sample Input 3

1
6
-1 -1
2 -1
3 3
2 4
1 4
-2 1
6
2 2
3 0
1 -6
2 6
-5 5
5 10

Sample Output 3

DA
DA
DA
NE
NE
NE

Explanation for Sample Output 3

The colored parts of the plane are the same as in the second example and the points in Mirko's queries are: ~(2, 2), (2, 1), (9, -14), (25, 29), (-32, 30)~ and ~(30, 17)~.