Dirigent

문제

Winter school of informatics ends with a traditional dance. There are $nn$ students who participate. Each of them has a unique label between $11$ and $nn$.

First, conductor Krešo orders the students to form a circle such that each student holds hands with two other students.

Alenka is wondering if it is possible to break the circle by making exactly one pair of neighbouring students stop holding hands and that the newly formed sequence of students is sorted by their labels. For example, if their order is 3 4 1 2, than the circle can be broken between students with labels 4 and 1, but if their order is 2 1 4 3, than there is no way to break the circle in such way.

During the night Krešo is going to give $qq$ instructions. In each of them, he is going to order two students to swap places. After each swap you need to help Alenka answer her question.

입력

The first line contains two integers $nn$ and $qq$ (1 ≤ n, q ≤ 300\,000), the number of students and the number of swaps.

The second line contains $nn$ integers $a_{i}a\_i$ (1 ≤ a_i ≤ n), describing the initial placement of students in the circle.

In each of the next $qq$ lines there are two integers $x_{i}x\_i$, $y_{i}y\_i$ (1 ≤ x_i , y_i ≤ n, $x_i\mathrm{\ne }{y}_{i}x\_i\; \backslash ne\; y\_i$), that describe Krešo’s $ii$-th instruction in which students with labels $x_{i}x\_i$ and $y_{i}y\_i$ swap places.

출력

In the $ii$-th of the $qq$ lines outs put the answer to Alenka’s question after $ii$ swaps have been carried out. If the answer is affirmative output DA, otherwise NE.

힌트

Clarification of the second example: Students in the beginning, after the first and after the second swap.

5 2
2 3 4 5 1
1 3
3 1

NE
DA

4 2
2 3 1 4
4 2
3 4

NE
DA

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

NE
NE
DA
NE
DA