#include <bits/stdc++.h>

using namespace std;

#define iter(v) v.begin(), v.end()
#define SZ(v) int(v.size())
#define pb emplace_back
#define ff first
#define ss second

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#ifdef zisk
void debug(){ cerr << "\n"; }
template<class T, class ... U>
void debug(T a, U ... b){ cerr << a << " ", debug(b...); }
template<class T> void pary(T l, T r) {
	while (l != r) cerr << *l << " ", l++;
	cerr << "\n";
}
#else
#define debug(...) void()
#define pary(...) void()
#endif

template<class A, class B>
ostream &operator<<(ostream &o, pair<A, B> p) {
	return o << '(' << p.ff << ',' << p.ss << ')';
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	int n, m, K;
	cin >> n >> m >> K;

	vector<vector<pii>> g(n + 1);
	vector<int> deg(n + 1);
	for (int i = 0; i < m; i++) {
		int u, v;
		cin >> u >> v;
		//u++; v++;
		g[u].pb(pii(v, i));
		g[v].pb(pii(u, i));
		deg[u]++; deg[v]++;
	}
	/*{
		vector<int> cnt(n);
		for (int i = 1; i <= n; i++) cnt[deg[i]]++;
		for (int i = 0; i < n; i++)
			if (cnt[i]) debug("cnt", i, cnt[i]);
	}*/

	for (int i = 1; i <= n; i++) {
		sort(iter(g[i]), [&](pii x, pii y){ return deg[x.ff] < deg[y.ff]; });
	}

	vector<bool> evst(m), vvst(n + 1);
	vector<vector<pii>> _path;
	mt19937 rng(time(NULL));

	auto gao = [&](int s) {
		_path.pb();
		auto &path = _path.back();
		path.pb(pii(s, -1));
		vvst[s] = true;

		while (SZ(path) < n) {
			int now = path.back().ff;
			bool ok = false;

			for (auto [v, e] : g[now]) {
				if (evst[e] || vvst[v]) continue;
				path.back().ss = e;
				path.pb(pii(v, -1));
				evst[e] = vvst[v] = true;
				ok = true;
				break;
			}
			if (ok) continue;

			vector<pii> good;
			for (auto [v, e] : g[now]) {
				if (evst[e]) continue;
				good.pb(pii(v, e));
			}
			auto [v, e] = good[rng() % SZ(good)];
			int i;
			for (i = 0; i < SZ(path); i++) {
				if (path[i].ff == v) break;
			}
			evst[path[i].ss] = false;
			evst[e] = true;
			path[i].ss = e;
			reverse(path.begin() + i + 1, path.end());
			for (int j = i + 1; j + 1 < SZ(path); j++)
				path[j].ss = path[j + 1].ss;
			path.back().ss = -1;
		}
	};

	vector<int> ord(n);
	iota(iter(ord), 1);
	sort(iter(ord), [&](int x, int y){ return deg[x] < deg[y]; });
	for (int t = 0; t < K; t++) {
		fill(iter(vvst), false);
		int s = -1, mindeg = -1;
		for (int i = 1; i <= n; i++) {
			int deg = 0;
			for (auto [v, e] : g[i])
				if (!evst[e]) deg++;
			if (mindeg == -1 || mindeg > deg)
				mindeg = deg, s = i;
		}
		gao(s);
		//debug("ok", t);
	}
	
	vector<bool> owo(m);
	for (auto &v : _path) {
		/*assert(SZ(v) == n);
		vector<bool> ok(n + 1);
		for (auto [i, e] : v) {
			assert(!ok[i]);
			if (e != -1) assert(!owo[e]);
			ok[i] = true;
			if (e != -1) owo[e] = true;
		}*/
		//pary(iter(v));
		for (int i = 0; i < n; i++) cout << v[i].ff << " \n"[i == n - 1];
	}

}