using namespace std;
#include <bits/stdc++.h>
#define N 500005
int n,m;
set<int> e[N];
int d[N];
int p[N],q[N];
int to[N];
int bel[N];
vector<int> vec[N];
int main(){
//	freopen("in.txt","r",stdin);
	int T;
	scanf("%d",&T);
	while (T--){
		scanf("%d%d",&n,&m);
		for (int i=1;i<=n;++i)
			e[i].clear();
		memset(d,0,sizeof(int)*(n+1));
		for (int i=1;i<=m;++i){
			int u,v;
			scanf("%d%d",&u,&v);
			e[u].insert(v);
			e[v].insert(u);
			d[u]++,d[v]++;
		}
		memset(p,0,sizeof(int)*(n+1));
		memset(q,0,sizeof(int)*(n+1));
		for (int i=1;i<=n;++i)
			if (d[i]==n-1)
				p[i]=q[i]=-1;
			else{
				for (int j=1;j<=n;++j)
					if (j!=i && e[i].find(j)==e[i].end()){
						to[i]=j;
						break;
					}
			}
		for (int i=1;i<=n;++i)
			vec[i].clear();
		memset(bel,0,sizeof(int)*(n+1));
		for (int i=1;i<=n;++i){
			if (d[i]==n-1) continue;
			if (!bel[i] && !bel[to[i]])
				bel[i]=to[i],bel[to[i]]=i;
		}
		for (int i=1;i<=n;++i)
			if (d[i]!=n-1 && bel[i]==0)
				vec[to[i]].push_back(i);
		int c=0;
		for (int i=1;i<=n;++i){
			if (d[i]==n-1) continue;
			if (bel[i] && i<bel[i]){
				int x=i,y=bel[i];
				if (vec[x].empty())
					swap(x,y);
				if (vec[x].empty()){
					p[x]=c+1,q[x]=c+2;
					p[y]=c+2,q[y]=c+1;
					c+=2;
				}
				else{
					if (vec[y].empty()){
						int t=c;
						++t,p[y]=t,q[y]=t+1;
						for (int j=0;j<vec[x].size();++j)
							++t,p[vec[x][j]]=t,q[vec[x][j]]=t+1;
						++t,p[x]=t,q[x]=c+1;
						c=t;
					}
					else{
						int t=c;
						for (int j=0;j<vec[x].size();++j)
							++t,p[vec[x][j]]=t,q[vec[x][j]]=t+1;
						++t,p[x]=t,q[x]=c+1;
						c=t;
						for (int j=0;j<vec[y].size();++j)
							++t,p[vec[y][j]]=t,q[vec[y][j]]=t+1;
						++t,p[y]=t,q[y]=c+1;
						c=t;
					}
				}
			}
		}
		for (int i=1;i<=n;++i)
			if (d[i]==n-1)
				p[i]=q[i]=++c;
		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");
	}
	return 0;
}
















