#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
#define derr if(0) cerr
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << flush;
// END NO SAD

template<class Fun>
class y_combinator_result {
  Fun fun_;
public:
  template<class T>
  explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}

  template<class ...Args>
  decltype(auto) operator()(Args &&...args) {
    return fun_(std::ref(*this), std::forward<Args>(args)...);
  }
};

template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
  return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

template<class T>
bool updmin(T& a, T b) {
  if(b < a) {
    a = b;
    return true;
  }
  return false;
}
template<class T>
bool updmax(T& a, T b) {
  if(b > a) {
    a = b;
    return true;
  }
  return false;
}
typedef int64_t ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef array<array<int, 2>, 2> matrix;

mt19937 g1(0x14004);
int get_random_int(int a, int b) {
  return uniform_int_distribution<int>(a, b)(g1);
}

void solve() {
  int n, m, k;
  cin >> n >> m >> k;
  vector<vector<int>> edges(n+1);
  while(m--) {
    int a, b;
    cin >> a >> b;
    edges[a].pb(b);
    edges[b].pb(a);
  }
  vector<int> ord(n);
  iota(all(ord), 1);
  sort(all(ord), [&](auto a, auto b) -> bool {
    return sz(edges[a]) < sz(edges[b]);
  });
  vector<vector<int>> ans;
  while(sz(ans) < k) {
    vector<int> curr;
    vector<bool> seen(n+1);
    curr.pb(get_random_int(1, n));
    seen[curr.back()] = true;
    int iter = 0;
    while(sz(curr) < n && iter++ < 500*n) {
      int cv = curr.back();
      vector<int> neighbors;
      bool found = false;
      while(sz(neighbors) < min(7, sz(edges[cv]))) {
        int neigh = edges[cv][get_random_int(0, sz(edges[cv]) - 1)];
        if(!seen[neigh]) {
          seen[neigh] = true;
          curr.pb(neigh);
          found = true;
          break;
        }
        neighbors.pb(neigh);
      }
      if(found) continue;
      int idx = sz(curr)-1;
      while(true) {
        for(int a: neighbors) {
          if(curr[idx] == a) {
            found = true;
            break;
          }
        }
        if(found) break;
        idx--;
      }
      reverse(curr.begin() + idx + 1, curr.end());
    }
    if(sz(curr) == n) {
      ans.pb(curr);
      for(int i = 0; i+1 < n; i++) {
        int a = curr[i];
        int b = curr[i+1];
        for(int x = 0; x < sz(edges[a]); x++) {
          if(edges[a][x] == b) {
            if(x != sz(edges[a])-1) {
              swap(edges[a][x], edges[a].back());
            }
            edges[a].pop_back();
            break;
          }
        }
        for(int x = 0; x < sz(edges[b]); x++) {
          if(edges[b][x] == a) {
            if(x != sz(edges[b])-1) {
              swap(edges[b][x], edges[b].back());
            }
            edges[b].pop_back();
            break;
          }
        }
      }
    }
  }
  for(int i = 0; i < k; i++) {
    for(int a = 0; a < n; a++) cout << ans[i][a] << " \n"[a == n-1];
  }
}

// what would chika do
// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases
// are you doing geometry in floating points
// are you not using modint when you should

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
}