CF1641C.Anonymity Is Important

In the work of a doctor, it is important to maintain the anonymity of clients and the results of tests. The test results are sent to everyone personally by email, but people are very impatient and they want to know the results right away.

That's why in the testing lab "De-vitro" doctors came up with an experimental way to report the results. Let's assume that $n$ people took the tests in the order of the queue. Then the chief doctor Sam can make several statements, in each telling if there is a sick person among the people in the queue from $l$-th to $r$-th (inclusive), for some values $l$ and $r$.

During the process, Sam will check how well this scheme works and will be interested in whether it is possible to find out the test result of $i$-th person from the information he announced. And if it can be done, then is that patient sick or not.

Help Sam to test his scheme.

在医生的工作中，保护患者隐私及检测结果的匿名性至关重要。检测结果会通过电子邮件单独发送给每位患者，但人们往往非常急切，希望立刻获知自己的检测结果。

因此，在“体外”（De-vitro）检测实验室中，医生们提出了一种实验性的结果通报方案。假设共有 $n$ 人按排队顺序接受了检测。那么，首席医生 Sam 可以发布若干条声明；每条声明针对某个区间 $[l, r]$（即队列中从第 $l$ 位到第 $r$ 位，含端点），说明该区间内是否存在患病者。

在整个过程中，Sam 将评估该方案的有效性，并特别关注：根据他所发布的全部信息，是否能唯一确定第 $i$ 位患者的检测结果？若可以确定，则该患者究竟是否患病？

请协助 Sam 测试这一方案。

The first line contains two integers $n$, $q$ ($1 \le n, q \le 2 \cdot 10^5$) — the number of people and the number of queries.

In each of the next $q$ lines, the description of the query is given. The first number in the line is $t$ ($t = 0$ or $t = 1$) — the type of the query.

If $t = 0$, the line contains three more integers $l, r, x$ ($1 \le l \le r \le n$, $x = 0$ or $x = 1$). This query means that Sam tells that among the people in the queue from $l$-th to $r$-th (inclusive):

• there was at least one sick person, if $x=1$,
• there is no sick people, if $x=0$.

If $t = 1$, the line contains one more integer $j$ ($1 \le j \le n$) — the position of the patient in the queue, for which Sam wants to know the status.

All queries are correct, that means that there always exists an example of the queue of length $n$ for which all reported results (statements from queries with $t = 0$) are true.

第一行包含两个整数 $n$、$q$（$1 \le n, q \le 2 \cdot 10^5$）—— 分别表示人数和查询次数。

接下来的 $q$ 行中，每行描述一个查询。每行的第一个数为 $t$（$t = 0$ 或 $t = 1$）—— 表示查询类型。

若 $t = 0$，则该行还包含三个整数 $l$、$r$、$x$（$1 \le l \le r \le n$，$x = 0$ 或 $x = 1$）。该查询表示 Sam 声称：在队列中从第 $l$ 个人到第 $r$ 个人（含端点）这一区间内：

• 若 $x = 1$，则至少存在一名生病的人；
• 若 $x = 0$，则不存在任何生病的人。

若 $t = 1$，则该行还包含一个整数 $j$（$1 \le j \le n$）—— 表示 Sam 想要知道队列中第 $j$ 个位置上的人的健康状态。

所有查询均合法，即：总存在一个长度为 $n$ 的队列，使得所有 $t = 0$ 的查询所陈述的结果均为真。

After each Sam question (query with $t = 1$) print:

• "NO", if the patient is definitely not sick,
• "YES", if the patient is definitely sick.
• "N/A", if it is impossible to definitely identify the status of patient having the given information.

每次处理山姆的提问（即 $t = 1$ 的查询）后，输出：

• “NO”，表示该病人确定未患病；
• “YES”，表示该病人确定已患病；
• “N/A”，表示根据所给信息无法确定该病人的患病状态。

In the first test for the five first queries:

1. Initially Sam tells that people $4$, $5$ are not sick.
2. In the next query Sam asks the status of the patient $5$. From the previous query, we know that the patient is definitely not sick.
3. In the next query Sam asks the status of the patient $6$. We don't know any information about that patient now.
4. After that Sam tells that there exists a sick patient among $4$, $5$, $6$.
5. In the next query Sam asks the status of the patient $6$. Now we can tell that this patient is definitely sick.

在第一个测试用例的前五个查询中：

1. 最初，Sam 告知患者 $4$、$5$ 不患病。
2. 在下一个查询中，Sam 询问患者 $5$ 的状态。根据上一个查询，我们已知该患者一定不患病。
3. 在下一个查询中，Sam 询问患者 $6$ 的状态。此时我们对该患者没有任何信息。
4. 随后，Sam 告知患者 $4$、$5$、$6$ 中存在至少一名患病者。
5. 在下一个查询中，Sam 询问患者 $6$ 的状态。此时我们可以确定该患者一定患病。