Problem C
Sopsug
Grushög is an unfinished residential area in the outskirts of Lund. Right now, all necessary infrastructure is being constructed, including the most important thing of all: garbage disposal. Like in many areas of Sweden, a sopsug (automated vacuum collection system) will be used to collect garbage. The idea is to transport garbage underground through tubes using air pressure.
There are $N$ buildings in Grushög, numbered from $0$ to $N1$. Your task is to connect some pairs of buildings with tubes. If you build a tube from building $u$ to some other building $v$, $u$ will send all of its garbage to $v$ (but not in the other direction). Your goal is to create a network of $N1$ tubes such that all garbage ends up in one building. In other words, you want the network to form a rooted tree, where the edges are directed toward the root.
However, $M$ tubes have already been constructed between buildings. These must be used in your network. These tubes are directed, so they can only be used in one direction.
Furthermore, there are $K$ pairs of buildings between which it is impossible to build a tube. These pairs are ordered, so if it is impossible to build a tube from $u$ to $v$, it may still be possible to build one from $v$ to $u$.
Input
The first line of input contains the three integers, $N$, $M$, and $K$.
The following $M$ lines each contain two distinct integers $a_ i, b_ i$, meaning that there is already a tube from $a_ i$ to $b_ i$.
The following $K$ lines each contain two distinct integers $c_ i, d_ i$, meaning that it is impossible to build a tube from $c_ i$ to $d_ i$.
All of the $M+K$ ordered pairs in the input will be distinct. Note that $(u,v)$ and $(v,u)$ are regarded as different pairs.
Output
If there is no solution, print NO.
Otherwise, print $N1$ lines, each containing two integers $u_ i$, $v_ i$, meaning that there should be a tube directed from $u_ i$ to $v_ i$. You may print the tubes in any order. If there are multiple solutions, you may print any of them. Remember that all the $M$ already existing tubes must be included in your solution.
Constraints and Scoring

$2 \leq N \leq 300\, 000$.

$0 \leq M \leq 300\, 000$.

$0 \leq K \leq 300\, 000$.

$0 \leq a_ i, b_ i \leq N1$ for $i = 0, 1, \ldots , M1$.

$0 \leq c_ i, d_ i \leq N1$ for $i = 0, 1, \ldots , K1$.
Your solution will be tested on a set of test groups, each worth a number of points. Each test group contains a set of test cases. To get the points for a test group you need to solve all test cases in the test group.
Group 
Score 
Limits 
1 
12 
$M = 0$ and $K = 1$ 
2 
10 
$M = 0$ and $K = 2$ 
3 
19 
$K = 0$ 
4 
13 
$N \leq 100$ 
5 
17 
It is guaranteed that there is a solution with $0$ as the root 
6 
11 
$M = 0$ 
7 
18 
No additional constraints 
Example
The following figures show the first and second sample test cases. The blue edges mark tubes which are already constructed, and the dashed red edges mark tubes which are impossible to build.
The figure to the left shows the first sample with the solution from the sample output, showing tubes with black edges (in addition to the already constructed tube from $4$ to $1$ which is blue). In this network, all garbage will be collected in building $0$. This is not the only solution; for example, the tube from $1$ to $3$ can be replaced by a tube from $0$ to $1$ and it is still a valid solution.
For the second sample input, we can see in the right figure that it is impossible to construct a solution because of the cycle $(2, 3, 4)$.
Sample Input 1  Sample Output 1 

5 1 8 4 1 3 1 3 4 3 2 0 2 0 4 2 4 1 0 2 0 
4 1 3 0 1 3 2 3 
Sample Input 2  Sample Output 2 

5 4 0 1 0 2 3 3 4 4 2 
NO 
Sample Input 3  Sample Output 3 

3 0 1 0 1 
1 0 2 0 
Sample Input 4  Sample Output 4 

4 0 2 0 1 1 0 
2 0 3 0 1 3 