#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5 + 10;

int n, m, ind[MAXN];
vector<int> nxt[MAXN];
int opt = 1, s = 1, l;
int ans[MAXN];

int main() {
	freopen("graperm.in", "r", stdin);
	freopen("graperm.out", "w", stdout);
	int c, T;
	scanf("%d%d", &c, &T);
	while(T--) {
		scanf("%d%d", &n, &m);
		l = n;
		s = 1;
		opt = 1;
		for(int i = 1, a, b; i <= n; i++) ind[i] = 0;
		for(int i = 1, a, b; i <= m; i++) scanf("%d%d", &a, &b),nxt[a].push_back(b), nxt[b].push_back(a), ++ind[b], ++ind[a];
		int t = 1;
		for(int i = 1; i <= n; i++) {
			if(ind[i] == 1) t = i;
		}
		queue<int> z;
		z.push(t);
		while(!z.empty()) {
			int x = z.front();
			z.pop();
			if(opt) ans[x] = ++s;
			else ans[x] = --l;
			opt ^= 1;
		}
		for(int i = 1; i <= n; i++) printf("%d\n", ans[i]);
		printf("\n");
	}
	return 0;
}