human
This is the easy version of the problem. The only difference between the two versions is the constraint on n. You can make hacks only if all versions of the problem are solved.

A forest is an undirected graph without cycles (not necessarily connected).

Mocha and Diana are friends in Zhijiang, both of them have a forest with nodes numbered from 1 to n, and they would like to add edges to their forests such that: 

  * After adding edges, both of their graphs are still forests. 
  * They add the same edges. That is, if an edge (u, v) is added to Mocha's forest, then an edge (u, v) is added to Diana's forest, and vice versa. 


Mocha and Diana want to know the maximum number of edges they can add, and which edges to add.

Input

The first line contains three integers n, m_1 and m_2 (1 ≤ n ≤ 1000, 0 ≤ m_1, m_2 < n) — the number of nodes and the number of initial edges in Mocha's forest and Diana's forest.

Each of the next m_1 lines contains two integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the edges in Mocha's forest.

Each of the next m_2 lines contains two integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the edges in Diana's forest.

Output

The first line contains only one integer h, the maximum number of edges Mocha and Diana can add (in each forest).

Each of the next h lines contains two integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the edge you add each time.

If there are multiple correct answers, you can print any one of them.

Examples

Input

3 2 2
1 2
2 3
1 2
1 3

Output

0

Input

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

Output

1
2 4

Input

8 1 2
1 7
2 6
1 5

Output

5
5 2
2 3
3 4
4 7
6 8

Note

In the first example, we cannot add any edge.

In the second example, the initial forests are as follows.


We can add an edge (2, 4).

The above is tricky. Write me a correct solution in PYTHON3.
assistant
#Here is Python program to print any one of them.

class DisjointSet:
    def __init__(self, n):
        self.parent = [-1] * n
        self.forest = n

    def find(self, u):
        if self.parent[u] == -1:
            return u
        self.parent[u] = self.find(self.parent[u])
        return self.parent[u]

    def union(self, u, v):
        p1, p2 = self.find(u), self.find(v)
        if p1 == p2:
            return

        self.parent[p1] = p2
        self.forest -= 1

n, m1, m2 = list(map(int, input().split()))
ds1, ds2 = DisjointSet(n), DisjointSet(n)

for _ in range(m1):
    u, v = list(map(int, input().split()))
    ds1.union(u-1, v-1)

for _ in range(m2):
    u, v = list(map(int, input().split()))
    ds2.union(u-1, v-1)

r = []
for i in range(n):
    for j in range(n):
        if i == j or ds1.find(i) == ds1.find(j) or ds2.find(i) == ds2.find(j):
            continue
        ds1.union(i, j)
        ds2.union(i, j)
        r.append((i, j))

print(len(r))
for u, v in r:
    print(u+1, v+1)