#include <bits/stdc++.h>
int c, T, n, m, tmp, temp, u[200010], v[200010], a[200010], b[200010], p[100010];
bool flag, flag1;
int main() {
	freopen("graperm.in", "r", stdin);
	freopen("graperm.out", "w", stdout);
	scanf("%d%d", &c, &T);
	if(c <= 2){
		while(T--){
			flag = 0;
			scanf("%d%d", &n, &m);
			for(int i = 1;i <= m;i++) scanf("%d%d", &u[i], &v[i]);
			for(int i = 1;i <= n;i++) p[i] = i;
			while(1){
				flag1 = 1;
				if(flag) std::next_permutation(p + 1, p + n + 1);
				else flag = 1;
				for(int i = 1;i <= m;i++){
					for(int j = 1;j <= n;j++){
						if(p[j] == u[i]) tmp = j;
						if(p[j] == v[i]) temp = j;
					}
					//printf("%d %d\n", tmp, temp);
					if(tmp > temp) std::swap(tmp, temp);
					a[i] = tmp; b[i] = temp;
				}
				for(int i = 1;i <= m && flag1;i++){
					for(int j = 1;j <= m;j++){
						if((a[i] < a[j] && a[j] < b[i] && b[i] < b[j]) || (a[j] < a[i] && a[i] < b[j] && b[j] < b[i])){
							flag1 = 0;
							break;
						}
					}
				}
				if(flag1){
				//	for(int i = 1;i <= m;i++) printf("%d %d\n", a[i], b[i]);
					for(int i = 1;i <= n;i++) printf("%d ", p[i]);
					printf("\n");
					break;
				}
			}
		}
		return 0;
	}
	while(T--){
		scanf("%d%d", &n, &m);
		for(int i = 1;i <= m;i++) scanf("%d%d", &u[i], &v[i]);
		for(int i = 1;i <= n;i++) printf("%d ", i);
		printf("\n");
	}
	return 0;
}