CF1814F.Communication Towers

There are $n$ communication towers, numbered from $1$ to $n$, and $m$ bidirectional wires between them. Each tower has a certain set of frequencies that it accepts, the $i$-th of them accepts frequencies from $l_i$ to $r_i$.

Let's say that a tower $b$ is accessible from a tower $a$, if there exists a frequency $x$ and a sequence of towers $a=v_1, v_2, \dots, v_k=b$, where consecutive towers in the sequence are directly connected by a wire, and each of them accepts frequency $x$. Note that accessibility is not transitive, i. e if $b$ is accessible from $a$ and $c$ is accessible from $b$, then $c$ may not be accessible from $a$.

Your task is to determine the towers that are accessible from the $1$-st tower.

共有 $n$ 座通信塔，编号从 $1$ 到 $n$，以及它们之间连接的 $m$ 条双向通信线路。每座塔都支持某个频率范围：第 $i$ 座塔支持的频率范围为 $l_i$ 到 $r_i$（含端点）。

我们称塔 $b$ 可从塔 $a$ 到达，当且仅当存在某个频率 $x$，以及一个塔序列 $a = v_1, v_2, \dots, v_k = b$，使得该序列中相邻两座塔由一条线路直接相连，且序列中每一座塔均支持频率 $x$。注意：可达性不具备传递性，即若 $b$ 可从 $a$ 到达，且 $c$ 可从 $b$ 到达，这并不意味着 $c$ 一定可从 $a$ 到达。

你的任务是确定所有可从第 $1$ 座塔到达的塔。

The first line contains two integers $n$ and $m$ ($1 \le n \le 2 \cdot 10^5$; $0 \le m \le 4 \cdot 10^5$) — the number of communication towers and the number of wires, respectively.

Then $n$ lines follows, the $i$-th of them contains two integers $l_i$ and $r_i$ ($1 \le l_i \le r_i \le 2 \cdot 10^5$) — the boundaries of the acceptable frequencies for the $i$-th tower.

Then $m$ lines follows, the $i$-th of them contains two integers $v_i$ and $u_i$ ($1 \le v_i, u_i \le n$; $v_i \ne u_i$) — the $i$-th wire that connects towers $v_i$ and $u_i$. There are no two wires connecting the same pair of towers.

第一行包含两个整数 $n$ 和 $m$（$1 \le n \le 2 \cdot 10^5$；$0 \le m \le 4 \cdot 10^5$），分别表示通信塔的数量和导线的数量。

接下来是 $n$ 行，其中第 $i$ 行包含两个整数 $l_i$ 和 $r_i$（$1 \le l_i \le r_i \le 2 \cdot 10^5$），表示第 $i$ 座塔可接受的频率范围。

接下来是 $m$ 行，其中第 $i$ 行包含两个整数 $v_i$ 和 $u_i$（$1 \le v_i, u_i \le n$；$v_i \ne u_i$），表示连接第 $v_i$ 座塔与第 $u_i$ 座塔的第 $i$ 条导线。不存在两条导线连接同一对塔。

In a single line, print distinct integers from $1$ to $n$ in ascending order — the indices of the communication towers that are accessible from the $1$-st tower.

在一行中，按升序输出 $1$ 到 $n$ 之间的互不相同的整数——即从第 $1$ 座通信塔可达的通信塔的编号。