/* name: 7278
 * author: 5ab
 * created at: 2024-05-29
 */
#include <bits/stdc++.h>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define ssz(x) (int((x).size()))

auto chmax = [](auto& x, auto y) { if (x < y) x = y; };
auto chmin = [](auto& x, auto y) { if (y < x) x = y; };

using ll = long long;
const int N = 1e5, NS = 5e5;

vector<int> a[N], b[N], c[N];
int hd[N * 2], des[NS * 2], nxt[NS * 2], deg[N * 2], ec = 0;
bool inst[N * 2], vis[NS];

void add(int s, int t)
{
	// cerr << s << " --> " << t << endl;
	des[ec] = t, deg[s]++;
	nxt[ec] = hd[s];
	hd[s] = ec++;
}

int n, t;

vector<int> stk;
void dfs(int id)
{
	stk.clear();
	stk.push_back(id);
	auto sv = [&](int x, int y)
	{
		if (x >= n)
		{
			// cerr << "b " << y << " " << x - n << endl;
			b[y].push_back(x - n);
		}
		else
		{
			// cerr << "c " << x << " " << y - n << endl;
			c[x].push_back(y - n);
		}
	};
	// cerr << "start ";
	while (true)
	{
		int &p = hd[id];
		// cerr << id << " ";
		while (p != -1 && vis[p >> 1]) p = nxt[p];
		if (p == -1)
		{
			for (int j = 1; j < ssz(stk); j++)
				sv(stk[j - 1], stk[j]);
			for (int x : stk)
				inst[x] = 0;
			return;
		}
		int dst = des[p];
		deg[id]--, deg[dst]--, vis[p >> 1] = 1;
		stk.push_back(dst);
		if (inst[dst])
		{
			do {
				int x = stk.back();
				stk.pop_back(), inst[x] = 0;
				sv(stk.back(), x);
			} while (stk.back() != dst);
		}
		inst[dst] = 1;
		id = dst, p = nxt[p];
	}
	inst[id] = 0;
}

vector<int> ci;
void solve(int l, int r)
{
	if (l == r)
		return;
	
	ci.clear();
	for (int j = 0; j < n; j++)
		ci.push_back(j), b[j].clear(), c[j].clear();
	ec = 0;
	for (int i = l; i <= r; i++)
		for (int j = 0; j < n; j++)
		{
			add(j, n + a[j][i]);
			add(n + a[j][i], j);
			ci.push_back(n + a[j][i]);
		}
	fill(vis, vis + ec / 2, 0);
	
	// for (int x : ci)
	// 	cerr << x << ": " << deg[x] << endl;
	for (int i : ci)
		if (deg[i] & 1)
		{
			// cerr << "deg " << i << " " << deg[i] << endl;
			dfs(i);
		}
	for (int i : ci)
		if (hd[i] != -1)
			dfs(i);
	for (int x : ci)
		hd[x] = -1;
	
	int mid = (l + r) >> 1;
	for (int i = 0; i < n; i++)
	{
		// cerr << i << " " << ssz(b[i]) << " " << ssz(c[i]) << endl;
		assert(ssz(b[i]) == mid - l + 1), assert(ssz(c[i]) == r - mid);
		for (int j = l; j <= mid; j++)
			a[i][j] = b[i][j - l];
		for (int j = mid + 1; j <= r; j++)
			a[i][j] = c[i][j - mid - 1];
	}
	solve(l, mid), solve(mid + 1, r);
}

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int s;
	
	cin >> n >> s >> t;
	for (int i = 0; i < n; i++)
	{
		a[i].resize(s);
		for (int j = 0; j < s; j++)
			cin >> a[i][j], a[i][j]--;
	}
	
	fill(hd, hd + n + t, -1);
	solve(0, s - 1);
	
	for (int i = 0; i < n; i++)
		for (int j = 0; j < s; j++)
			cout << a[i][j] + 1 << " \n"[j == s - 1];
	
	return 0;
}
// started coding at: 05-29 17:33:31