Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

F3. Tree of Life (hard)

time limit per test

8 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputTo add insult to injury, the zombies have taken all but two drawings from Heidi! Please help her recover the Tree of Life from only these two drawings.

Input

The input format is the same as in the medium version, except that now the bound on *n* is 2 ≤ *n* ≤ 1000 and that *k* = 2.

Output

The same as in the medium version.

Example

Input

1

9 2

6

4 3

5 4

6 1

8 6

8 2

7 1

5

8 6

8 7

8 1

7 3

5 1

Output

YES

2 1

3 1

5 4

6 5

7 6

8 5

9 8

1 4

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/20/2019 07:00:03 (d3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|