#include<bits/stdc++.h>
using namespace std;

namespace Prumize {

constexpr int MAXN = 100;

pair<int, int> e[MAXN], c[MAXN];
int a[MAXN], b[MAXN];

void Main() {
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int u, v;
		cin >> u >> v;
		e[i] = {u, v};
	}
	iota(a + 1, a + n + 1, 1);
	do {
		for (int i = 1; i <= n; i++) {
			b[a[i]] = i;
		}
		for (int i = 1; i <= m; i++) {
			c[i] = {b[e[i].first], b[e[i].second]};
			if (c[i].first > c[i].second) {
				swap(c[i].first, c[i].second);
			}
		}
		sort(c + 1, c + m + 1);
		bool f = true;
		for (int i = 1; i < m && f; i++) {
			for (int j = i + 1; j <= m && f; j++) {
				if (c[i].first < c[j].first && c[j].first < c[i].second && c[i].second < c[j].second) {
					f = false;
				}
			}
		}
		if (f) {
			for (int i = 1; i <= n; i++) {
				cout << a[i] << " \n"[i==n];
			}
			return;
		}
	} while (next_permutation(a + 1, a + n + 1));
}

}

int main() {
	freopen("graperm.in", "r", stdin);
	freopen("graperm.out", "w", stdout);
	cin.tie(nullptr)->sync_with_stdio(false);
	int c, T;
	cin >> c >> T;
	while (T --> 0) {
		Prumize::Main();
	}
	return 0;
}