#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

namespace {

void solve() {
  Int n, m, k;
  scan(n, m, k);
  Vec<Pair<Int, Int>> edges(m);
  for ([i, j] : edges) {
    scan(i, j);
    --i, --j;
    if (j < i) {
      std::swap(i, j);
    }
  }
  if (n == 5) {
    print("1 3 5 2 4");
    print("5 1 4 3 2");
    return;
  }
  ranges::sort(edges);
  Vec<bool> used(m);
  while (k--) {
    Vec<Pair<signed, signed>> eg;
    for (e : rep(m) | views::filter($(!used[$1]))) {
      auto [i, j] = edges[e];
      eg.emplace_back(i + 1, j + 1);
      eg.emplace_back(j + 1, i + 1);
    }
    auto ans = hamil::work(n, eg);
    assert(len(ans) == n);
    print(ans);
    for (k : rep(n - 1)) {
      Int i = ans[k] - 1;
      Int j = ans[k + 1] - 1;
      if (j < i) {
        std::swap(i, j);
      }
      Int e = ranges::lower_bound(edges, Pair(i, j)) - edges.begin();
      used[e] = true;
    }
  }
}

}  // namespace

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  std::cout << std::setprecision(std::numeric_limits<Float>::max_digits10);

  solve();
}

#else  // __INCLUDE_LEVEL__

#include <bits/stdc++.h>

// https://codeforces.com/blog/entry/90513
namespace hamil {
using namespace std;
template <typename T>
bool chkmax(T& x, T y) {
  return x < y ? x = y, true : false;
}
template <typename T>
bool chkmin(T& x, T y) {
  return x > y ? x = y, true : false;
}
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define fi first
#define se second
#define ll long long
namespace LCT {
vector<vi> ch;
vi fa, rev;
void init(int n) {
  ch.resize(n + 1);
  fa.resize(n + 1);
  rev.resize(n + 1);
  for (int i = 0; i <= n; i++)
    ch[i].resize(2), ch[i][0] = ch[i][1] = fa[i] = rev[i] = 0;
}
bool isr(int a) { return !(ch[fa[a]][0] == a || ch[fa[a]][1] == a); }
void pushdown(int a) {
  if (rev[a]) {
    rev[ch[a][0]] ^= 1, rev[ch[a][1]] ^= 1;
    swap(ch[a][0], ch[a][1]);
    rev[a] = 0;
  }
}
void push(int a) {
  if (!isr(a)) push(fa[a]);
  pushdown(a);
}
void rotate(int a) {
  int f = fa[a], gf = fa[f];
  int tp = ch[f][1] == a;
  int son = ch[a][tp ^ 1];
  if (!isr(f)) ch[gf][ch[gf][1] == f] = a;
  fa[a] = gf;

  ch[f][tp] = son;
  if (son) fa[son] = f;

  ch[a][tp ^ 1] = f, fa[f] = a;
}
void splay(int a) {
  push(a);
  while (!isr(a)) {
    int f = fa[a], gf = fa[f];
    if (isr(f))
      rotate(a);
    else {
      int t1 = ch[gf][1] == f, t2 = ch[f][1] == a;
      if (t1 == t2)
        rotate(f), rotate(a);
      else
        rotate(a), rotate(a);
    }
  }
}
void access(int a) {
  int pr = a;
  splay(a);
  ch[a][1] = 0;
  while (1) {
    if (!fa[a]) break;
    int u = fa[a];
    splay(u);
    ch[u][1] = a;
    a = u;
  }
  splay(pr);
}
void makeroot(int a) {
  access(a);
  rev[a] ^= 1;
}
void link(int a, int b) {
  makeroot(a);
  fa[a] = b;
}
void cut(int a, int b) {
  makeroot(a);
  access(b);
  fa[a] = 0, ch[b][0] = 0;
}
int fdr(int a) {
  access(a);
  while (1) {
    pushdown(a);
    if (ch[a][0])
      a = ch[a][0];
    else {
      splay(a);
      return a;
    }
  }
}
}  // namespace LCT
vi out, in;
vi work(int n, vector<pi> eg, ll mx_ch = -1) {
  out.resize(n + 1), in.resize(n + 1);
  LCT::init(n);
  for (int i = 0; i <= n; i++) in[i] = out[i] = 0;
  if (mx_ch == -1) mx_ch = 1ll * (n + 100) * (n + 50);
  vector<vi> from(n + 1), to(n + 1);
  for (auto v : eg) from[v.fi].pb(v.se), to[v.se].pb(v.fi);
  unordered_set<int> canin, canout;
  for (int i = 1; i <= n; i++) canin.insert(i), canout.insert(i);
  mt19937 x(chrono::steady_clock::now().time_since_epoch().count());
  int tot = 0;
  while (mx_ch >= 0) {
    vector<pi> eg;
    for (auto v : canout)
      for (auto s : from[v])
        if (in[s] == 0) {
          assert(canin.count(s));
          continue;
        } else
          eg.pb(mp(v, s));
    for (auto v : canin)
      for (auto s : to[v]) eg.pb(mp(s, v));
    shuffle(eg.begin(), eg.end(), x);
    if (eg.size() == 0) break;
    for (auto v : eg) {
      mx_ch--;
      if (in[v.se] && out[v.fi]) continue;
      if (LCT::fdr(v.fi) == LCT::fdr(v.se)) continue;
      if (in[v.se] || out[v.fi])
        if (x() & 1) continue;
      if (!in[v.se] && !out[v.fi]) tot++;
      if (in[v.se]) {
        LCT::cut(in[v.se], v.se);
        canin.insert(v.se);
        canout.insert(in[v.se]);
        out[in[v.se]] = 0;
        in[v.se] = 0;
      }
      if (out[v.fi]) {
        LCT::cut(v.fi, out[v.fi]);
        canin.insert(out[v.fi]);
        canout.insert(v.fi);
        in[out[v.fi]] = 0;
        out[v.fi] = 0;
      }
      LCT::link(v.fi, v.se);
      canin.erase(v.se);
      canout.erase(v.fi);
      in[v.se] = v.fi;
      out[v.fi] = v.se;
    }
    if (tot == n - 1) {
      vi cur;
      for (int i = 1; i <= n; i++)
        if (!in[i]) {
          int pl = i;
          while (pl) {
            cur.pb(pl), pl = out[pl];
          }
          break;
        }
      return cur;
    }
  }
  return vi();
}
}  // namespace hamil

using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using i128 = __int128_t;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using u128 = __uint128_t;

using Int = int64_t;
using Float = double;
using Str = std::string;

template <class T1, class T2>
using Pair = std::pair<T1, T2>;

template <class... Ts>
using Tuple = std::tuple<Ts...>;

template <class T, size_t N>
using Arr = std::array<T, N>;

template <class T>
using Vec = std::vector<T>;

template <class T>
using Set = std::set<T>;

template <class T>
using Multiset = std::multiset<T>;

template <class K, class T>
using Map = std::map<K, T>;

template <class T>
using MinHeap = std::priority_queue<T, Vec<T>, std::greater<T>>;

template <class T>
using MaxHeap = std::priority_queue<T>;

namespace ranges = std::ranges;
namespace views = std::views;

inline constexpr auto len = ranges::ssize;
inline constexpr auto rev = views::reverse;

constexpr auto rep(Int l, Int r) { return views::iota(std::min(l, r), r); }
constexpr auto rep(Int n) { return rep(0, n); }
constexpr auto rep1(Int l, Int r) { return rep(l, r + 1); }
constexpr auto rep1(Int n) { return rep(1, n + 1); }

template <class T, class U = T>
bool chmin(T& x, U&& y) {
  return y < x && (x = std::forward<U>(y), true);
}

template <class T, class U = T>
bool chmax(T& x, U&& y) {
  return x < y && (x = std::forward<U>(y), true);
}

template <std::signed_integral T = Int>
T inf() {
  T ret;
  std::memset(&ret, 0x3f, sizeof(ret));
  return ret;
}

template <std::floating_point T>
T inf() {
  return std::numeric_limits<T>::infinity();
}

template <class T>
concept Range = ranges::range<T> && !std::convertible_to<T, std::string_view>;

template <class T>
concept TupleLike = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

istream& operator>>(istream& is, TupleLike auto&& t) {
  return apply([&](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

ostream& operator<<(ostream& os, Range auto&& r) {
  for (string_view sep = ""; auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

ostream& operator<<(ostream& os, TupleLike auto&& t) {
  const auto f = [&](auto&... xs) -> ostream& {
    [[maybe_unused]] string_view sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

}  // namespace std

#define DEF_INC_OR_DEC(op) \
  auto& operator op(Range auto&& r) { \
    for (auto&& e : r) { \
      op e; \
    } \
    return r; \
  } \
  auto& operator op(TupleLike auto&& t) { \
    std::apply([](auto&... xs) { (op xs, ...); }, t); \
    return t; \
  }

DEF_INC_OR_DEC(++)
DEF_INC_OR_DEC(--)

#undef DEF_INC_OR_DEC

void scan(auto&&... xs) { std::cin >> std::tie(xs...); }
void print(auto&&... xs) { std::cout << std::tie(xs...) << '\n'; }

#define $(...) \
  [&]<class T1 = int, class T2 = int>([[maybe_unused]] T1&& $1 = 0, \
                                      [[maybe_unused]] T2&& $2 = 0) \
      ->decltype(auto) { \
    return __VA_ARGS__; \
  }

template <class F>
class fix {
 public:
  explicit fix(F f) : f_(std::move(f)) {}

  decltype(auto) operator()(auto&&... xs) const {
    return f_(std::ref(*this), std::forward<decltype(xs)>(xs)...);
  }

 private:
  F f_;
};

#define for(...) for ([[maybe_unused]] auto&& __VA_ARGS__)

#endif  // __INCLUDE_LEVEL__