#include <iostream>
#include <cstdio>
#include <cstring>
#include <set>
#define gc getchar()
#define idg(ch) isdigit(ch)
#define N 500050
using namespace std;

inline void read(int &x, int f = 1) {
	x = 0; char ch = gc;
	while (!idg(ch)) f = ch == '-' ? -1 : 1, ch = gc;
	while (idg(ch)) x = (x << 3) + (x << 1) + (ch ^ 48), ch = gc;
	x *= f;
}

int T, n, m, tot, cnt; // ÅÅÁÐtot£¬ ¼¯ºÏcnt 
int id[N], rt[N], p[N], q[N];

set<int>edge[N], S[N];

int find(int x) {
	for (int i = 1; i <= n; i++) if (!edge[x].count(i) && i != x) return i;
	return n + 1;
}

void merge(int x, int y) {
	rt[id[x] = id[y] = ++cnt] = x;
	S[cnt].insert(x), S[cnt].insert(y);
}

void solve() {
	for (int i = 1; i <= n; i++) {
		if (edge[i].size() == n - 1) {p[i] = q[i] = ++tot; continue;}
		if (id[i]) continue;
		int nxt = find(i);
		if (!id[nxt]) merge(i, nxt);
		else if (S[id[nxt]].size() == 2 || rt[id[nxt]] == nxt) S[id[i] = id[nxt]].insert(i), rt[id[i]] = nxt;
		else S[id[nxt]].erase(nxt), merge(i, nxt);
	}
	//±éÀú¼¯ºÏÄÚ²¿ 
	for (int i = 1; i <= cnt; i++) {
		p[rt[i]] = ++tot;
//		printf("set: ");
		for (set<int>::iterator it = S[i].begin(); it != S[i].end(); it++) {
//			printf("%d ", *it);
			if (*it != rt[i]) q[*it] = tot, p[*it] = ++tot;
		}
//		printf("\n");
		q[rt[i]] = tot;
	} 
}

void preset() {
	tot = cnt = 0;
	for (int i = 1; i <= n; i++) {
		S[i].clear(), edge[i].clear(), p[i] = q[i] = id[i] = rt[i] = 0;
	}
}

void init() {
	read(n), read(m);
	preset();
	for (int i = 1, x, y; i <= m; i++) {
		read(x), read(y);
		edge[x].insert(y), edge[y].insert(x);
	}
	solve();
	for (int i = 1; i <= n; i++) printf("%d ", p[i]); printf("\n");
	for (int i = 1; i <= n; i++) printf("%d ", q[i]); printf("\n");
}

signed main() {
	read(T);
	while (T--) {
		init();
	}
}
	 	 		   	  	  	 	  	  					