A campus chemistry lab keeps three shelves stocked for a routine synthesis: a catalyst shelf, a reactant shelf, and a solvent shelf. Each shelf holds a list of batch codes (positive integers), and no two batches on the same shelf share a code — but the same numeric code can happen to sit on more than one shelf, since each shelf was numbered independently by whoever restocked it. To run one synthesis you must pick exactly one batch from each shelf to fill the catalyst role, the reactant role, and the solvent role. A single physical batch cannot be poured into two roles at once, so a chosen combination is only usable if the three picked codes are pairwise different. Given the three shelves, list every usable combination.

Input format

Line 1: three integers n1 n2 n3 — the number of batches on the catalyst shelf, the reactant shelf, and the solvent shelf. Line 2: n1 integers — the catalyst shelf's batch codes. Line 3: n2 integers — the reactant shelf's batch codes. Line 4: n3 integers — the solvent shelf's batch codes.

Output format

Print one line "a b c" for every usable combination, where a is a catalyst code, b is a reactant code, and c is a solvent code, with a, b, c pairwise distinct. Order the lines by a ascending, then by b ascending, then by c ascending. If no usable combination exists, print nothing.

Constraints

• 1 <= n1, n2, n3 <= 50
• 1 <= each batch code <= 100
• Within a single shelf, all batch codes are distinct.

2 2 2
1 2
2 3
3 1

1 2 3
2 3 1

1 1 1
5
5
5

(empty)