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

typedef pair <int, int> pii;

int N, M;
vector <vector <int>> adj;
vector <int> deg;

void init() {
  deg = vector <int> (N + 1, 0);
  adj = vector <vector <int>> (N + 1, vector <int> ());
}

void add_edge(int u, int v) {
  adj[u].push_back(v);
  adj[v].push_back(u);
  deg[u]++;
  deg[v]++;
}

void load() {
  scanf("%d%d", &N, &M);
  init();
  while (M--) {
    int l, r;
    scanf("%d%d", &l, &r);
    add_edge(l, r);
  }
}

void solve() {
  vector <bool> done(N + 1);
  vector <bool> neighbour(N + 1);
  vector <pii> edges;
  for (int i = 1; i <= N; i++) {
    if (done[i] || deg[i] == N - 1)
      continue;
    adj[i].push_back(i);
    for (auto it : adj[i])
      neighbour[it] = true;
    int mex = 1;
    while (neighbour[mex])
      mex++;
    for (auto it : adj[i])
      neighbour[it] = false;
    done[i] = done[mex] = true;
    edges.push_back({i, mex});
  }
  init();
  for (auto it : edges)
    add_edge(it.first, it.second);
  vector <pii> stars;
  for (auto it : edges) 
    if (deg[it.first] > 1 && deg[it.second] > 1) {
      deg[it.first]--;
      deg[it.second]--;
    }
    else 
      stars.push_back(it);
  init();
  for (auto it : stars) 
    add_edge(it.first, it.second);
  int curr = 1;
  vector <int> p(N + 1), q(N + 1);
  for (int i = 1; i <= N; i++) {
    bool check = true;
    for (auto it : adj[i])
      check &= deg[it] == 1;
    if (check && !p[i]) {
      p[i] = curr;
      q[i] = curr + deg[i];
      for (int j = 0; j < deg[i]; j++) {
        p[adj[i][j]] = curr + j + 1;
        q[adj[i][j]] = curr + j;
      }
      curr += deg[i] + 1;
    }
  }
  for (int i = 1; i <= N; i++)
    if (!p[i]) 
      p[i] = q[i] = curr++;
  for (int i = 1; i <= N; i++)
    printf("%d ", p[i]);
  puts("");
  for (int i = 1; i <= N; i++)
    printf("%d ", q[i]);
  puts("");
}

int main() {
  int tc;
  scanf("%d", &tc);
  while (tc--) {
    load();
    solve();
  }
  return 0;
}
