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

#define ll long long
#define elif else if
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int,int>


#define repname(a, b, c, d, e, ...) e
#define rep(...)                    repname(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define rep0(x)                     for (int rep_counter = 0; rep_counter < (x); ++rep_counter)
#define rep1(i, x)                  for (int i = 0; i < (x); ++i)
#define rep2(i, l, r)               for (int i = (l); i < (r); ++i)
#define rep3(i, l, r, c)            for (int i = (l); i < (r); i += (c))





struct ScalarInput {
    template<class T>
    operator T(){
        T ret;
        cin >> ret;
        return ret;
    }
};
struct VectorInput {
    size_t n;
    VectorInput(size_t n): n(n) {}
    template<class T>
    operator vector<T>(){
        vector<T> ret(n);
        for(T &x : ret) cin >> x;
        return ret;
    }
};
ScalarInput input(){ return ScalarInput(); }
VectorInput input(size_t n){ return VectorInput(n); }

template<typename T>
void print(vector<T> a){
  for(int i=0;i<a.size();i++){
    cout<<a[i]<<" \n"[i+1==a.size()];
  }
}

template<class T>
void print(T x){
    cout << x << '\n';
}
 
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail){
  cout << head << ' ';
  print(forward<Tail>(tail)...);
}

mt19937 engine(42);

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int N, M, K; cin >> N >> M >> K;
  vector<vector<int>> graph(N);
  for (int i = 0; i < M; ++i)
  {
    int a, b; cin >> a >> b;
    a--, b--;
    graph[a].emplace_back(b);
    graph[b].emplace_back(a);
  }

  vector<vector<int>> res(K);
  for (int k = 0; k < K; ++k)
  {
    //  cerr << k << endl;

    int s = 0, mn = 100;
    for (int i = 0; i < N; ++i)
    {
      if (mn > (int)graph[i].size()) s = i, mn = graph[i].size();
    }
    res[k] = {s};

    vector<bool> seen(N, false);
    seen[s] = 1;
    int now = s;

    /*
    vector<int> ord_cnt(30,0);
    rep(v,N){
      ord_cnt[min(29,(int)graph[v].size())]++;
    }
    */
    
    while (int(res[k].size()) < N)
    {
      shuffle(graph[now].begin(), graph[now].end(), engine);
      int nxt = -1;
      for (auto u : graph[now])
      {
        if (!seen[u])
        {
          nxt = u;
          break;
        }
      }
      if (nxt != -1)
      {
        res[k].emplace_back(nxt);
        seen[nxt] = true;
        now = nxt;
        // cerr << res[k].size() << endl;
      }
      else
      {
        assert(graph[now].size());
        nxt = graph[now][0];
        int idx = -1;
        for (int i = 0; i < res[k].size(); ++i)
        {
          if (res[k][i] == nxt) idx = i;
        }
        reverse(res[k].begin() + idx + 1, res[k].end());
        now = res[k].back();
      }
    }
    // cerr << k << endl;

    vector<vector<int>> ngraph = graph;
    for (int i = 0; i < N - 1; ++i)
    {
      int a = res[k][i], b = res[k][i+1];
      int idx = -1;
      for (int j = 0; j < graph[a].size(); ++j)
      {
        if (graph[a][j] == b) idx = j;
      }
      assert(idx != -1);
      graph[a].erase(graph[a].begin() + idx);

      idx = -1;
      for (int j = 0; j < graph[b].size(); ++j)
      {
        if (graph[b][j] == a) idx = j;
      }
      assert(idx != -1);
      graph[b].erase(graph[b].begin() + idx);
    }

    // if (k == 1) break;
  }

  for (int k = 0; k < K; ++k)
  {
    assert((int)res[k].size() == N);
    for (int i = 0; i < N; ++i)
    {
      cout << res[k][i] + 1 << " \n"[i+1 == N];
    }
  }
  

  return 0;
}