A programming coach has n students to teach. We know that n is divisible by 3. Let's assume that all students are numbered from 1 to n, inclusive.

Before the university programming championship the coach wants to split all students into groups of three. For some pairs of students we know that they want to be on the same team. Besides, if the i-th student wants to be on the same team with the j-th one, then the j-th student wants to be on the same team with the i-th one. The coach wants the teams to show good results, so he wants the following condition to hold: if the i-th student wants to be on the same team with the j-th, then the i-th and the j-th students must be on the same team. Also, it is obvious that each student must be on exactly one team.

Help the coach and divide the teams the way he wants.

Input

The first line of the input contains integers n and m (3 ≤ n ≤ 48, $\text{[math]}$ . Then follow m lines, each contains a pair of integers a_i, b_i (1 ≤ a_i < b_i ≤ n) — the pair a_i, b_i means that students with numbers a_i and b_i want to be on the same team.

It is guaranteed that n is divisible by 3. It is guaranteed that each pair a_i, b_i occurs in the input at most once.

Output

If the required division into teams doesn't exist, print number -1. Otherwise, print $\text{[math]}$ lines. In each line print three integers x_i, y_i, z_i (1 ≤ x_i, y_i, z_i ≤ n) — the i-th team.

If there are multiple answers, you are allowed to print any of them.

Idx	Name	Rating
A	Array	1100
B	Coach	1500
C	Beautiful Numbers	1800
D	Painting Square	2300
E	Empire Strikes Back	2300

Codeforces Round 181 (Div. 2)