#include <iostream>

#include <cstdlib>

#include <cstring>

#include <cstdio>

#include <cmath>

#include <algorithm>

using namespace std;

const int MaxN = 3000 + 5;

int n, m, Cnt;

bool D[MaxN], Map[MaxN][MaxN];

int main()

{

	scanf("%d%d", &n, &m);

	int a, b;

	memset(Map, 0, sizeof(Map));

	for (int i = 1; i <= m; ++i) {

		scanf("%d%d", &a, &b);

		Map[a][b] = Map[b][a] = true;

	}

	memset(D, 0, sizeof(D));

	for (int i = 1; i <= n; ++i)

		if (!D[i])

			for (int j = 1; j <= n; ++j)

				if (j != i && !D[j] && !Map[i][j]) {

					D[i] = D[j] = true;

					break;

				}

	Cnt = 0;

	for (int i = 1; i <= n; ++i) {

		if (D[i]) continue;

		printf("%d", i);

		if (++Cnt == n / 3) {

			printf("\n"); break;

		}

		else printf(" ");

	}

	return 0;

}