A regional delivery hub keeps two separate logs each day: one filled in by the morning shift and one filled in by the evening shift. Each log lists, for every route run that shift completed, the driver's ID and the number of packages delivered on that run, in the order the runs were completed. At the end of the day, dispatch wants a single consolidated log formed by taking every morning entry first (kept in its original order) and then every evening entry (also kept in its original order), with every row renumbered starting at 1.

Input format

• Line 1 contains a single integer n1, the number of entries in the morning log.
• Each of the next n1 lines contains two space-separated integers driverId and packages — one morning-log entry, in log order.
• The next line contains a single integer n2, the number of entries in the evening log.
• Each of the next n2 lines contains two space-separated integers driverId and packages — one evening-log entry, in log order.

Output format

Print n1 + n2 lines. The first n1 lines are the morning entries in their original order, and the remaining n2 lines are the evening entries in their original order; each line has the form index driverId packages, where index starts at 1 for the first printed line and increases by 1 for each subsequent line. If both logs are empty, print nothing.

Constraints

• 0 <= n1, n2 <= 100000
• 1 <= driverId <= 10^9
• 0 <= packages <= 10000
• the same driverId may appear more than once, in the same log or across both logs

3
11 5
12 0
11 8
2
13 3
11 2

1 11 5
2 12 0
3 11 8
4 13 3
5 11 2

0
2
20 4
21 1

1 20 4
2 21 1