#include <set>
#include <cmath>
#include <vector>
#include <cassert>
#include <cstdint>
#include <iostream>
#include <algorithm>
using namespace std;

string to_string(const vector<int>& arr) {
	string res = "[";
	for (int i = 0; i < int(arr.size()); i++) {
		if (i != 0) {
			res += ", ";
		}
		res += to_string(arr[i]);
	}
	res += "]";
	return res;
}

uint64_t seed = 123456789;
uint64_t xorshift64() {
	seed ^= seed >> 13;
	seed ^= seed << 7;
	seed ^= seed >> 17;
	return seed;
}

int rand_int(int l, int r) {
	return l + int(xorshift64() % (r - l));
}

struct edge {
	int s, t;
};

vector<int> solve(int N, int M, const vector<edge>& es) {
	vector<vector<int> > g(N);
	vector<int> d(N);
	for (int i = 0; i < M; i++) {
		g[es[i].s].push_back(es[i].t);
		g[es[i].t].push_back(es[i].s);
		d[es[i].s]++;
		d[es[i].t]++;
	}
	vector<int> start_choice = { 0 };
	for (int i = 1; i < N; i++) {
		if (d[i] < d[start_choice[0]]) {
			start_choice = { i };
		} else if (d[i] == d[start_choice[0]]) {
			start_choice.push_back(i);
		}
	}
	vector<int> p;
	while (true) {
		int start = start_choice[rand_int(0, start_choice.size())];
		p = { start };
		vector<int> idx(N, -1);
		idx[start] = 0;
		uint64_t loops = 0;
		while (int(p.size()) != N && loops < 100000) {
			loops++;
			vector<int> choice;
			for (int i : g[p.back()]) {
				if (idx[i] == -1) {
					choice.push_back(i);
				}
			}
			if (!choice.empty()) {
				int z = choice[rand_int(0, choice.size())];
				p.push_back(z);
				idx[z] = int(p.size()) - 1;
			} else {
				int t = g[p.back()][rand_int(0, g[p.back()].size())];
				int l = idx[t] + 1;
				reverse(p.begin() + l, p.end());
				for (int i = l; i < int(p.size()); i++) {
					idx[p[i]] = i;
				}
			}
		}
		if (int(p.size()) == N) {
			break;
		}
	}
	return p;
}

vector<vector<int> > solve(int N, int M, int K, const vector<edge>& es) {
	vector<edge> cur_es = es;
	vector<vector<int> > ans(K);
	for (int t = 0; t < K; t++) {
		vector<int> p = solve(N, cur_es.size(), cur_es);
		ans[t] = p;
		vector<int> ip(N, -1);
		for (int i = 0; i < N; i++) {
			ip[p[i]] = i;
		}
		vector<edge> next_es;
		for (edge e : cur_es) {
			if (abs(ip[e.s] - ip[e.t]) != 1) {
				next_es.push_back(e);
			}
		}
		cur_es = next_es;
	}
	return ans;
}

vector<vector<int> > random_solve(int N, int M, int K) {
	set<pair<int, int> > s;
	vector<edge> es;
	for (int i = 0; i < M; i++) {
		int a, b;
		do {
			a = rand_int(0, N);
			b = rand_int(0, N);
		} while (a >= b || s.find(make_pair(a, b)) != s.end());
		s.insert(make_pair(a, b));
		es.push_back(edge{a, b});
	}
	vector<int> d(N);
	for (edge e : es) {
		d[e.s]++;
		d[e.t]++;
	}
	cerr << "mindegree = " << *min_element(d.begin(), d.end()) << endl;
	vector<vector<int> > ans = solve(N, M, K, es);
	return ans;
}

int main() {
	/*
	for (int t = 1; t <= 100; t++) {
		int u = clock();
		random_solve(10000, 200000, 8);
		cout << "t = " << t << ": " << clock() - u << endl;
	}
	return 0;
	*/
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int N, M, K;
	cin >> N >> M >> K;
	vector<edge> es(M);
	for (int i = 0; i < M; i++) {
		cin >> es[i].s >> es[i].t;
		es[i].s--;
		es[i].t--;
	}
	vector<vector<int> > ans = solve(N, M, K, es);
	for (int i = 0; i < K; i++) {
		for (int j = 0; j < N; j++) {
			if (j != 0) {
				cout << ' ';
			}
			cout << ans[i][j] + 1;
		}
		cout << endl;
	}
	return 0;
}