#include <bits/stdc++.h>
using namespace std;

#define N 110

int n, m, a[N][N];

int prv[N], vis[N];
vector<int> g[N][N];

int ans[N][N];

int bpm(int x) {
	for (int i = 1; i <= n; i ++) if (!g[x][i].empty()) {
		if (vis[i]) continue;
		vis[i] = 1;
		if (!prv[i] || (prv[i] && bpm(prv[i]))) {
			prv[i] = x; return 1;
		}
	}
	return 0;
}



int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i ++) for (int j = 1; j <= m; j ++) scanf("%d", &a[i][j]);
	for (int i = 1; i <= n; i ++) {
		for (int j = 1; j <= m; j ++) {
			int x = (a[i][j] - 1) / m + 1;
			g[i][x].push_back(a[i][j]);
		}
	}
	for (int i = 1; i <= m; i ++) {
		memset(prv, 0, sizeof prv);
		for (int j = 1; j <= n; j ++) {
			memset(vis, 0, sizeof vis);
			bpm(j);
		}
		for (int j = 1; j <= n; j ++) {
			vector<int> &cur = g[prv[j]][j];
			ans[i][prv[j]] = cur.back();
			cur.pop_back();
		}
	}
	for (int j = 1; j <= n; j ++) {
		for (int i = 1; i <= m; i ++) {
			printf("%d%c", ans[i][j], (i<m?' ':'\n'));
		}
	}
	for (int i = 1; i <= m; i ++) sort(ans[i] + 1, ans[i] + n + 1);
	for (int j = 1; j <= n; j ++) {
		for (int i = 1; i <= m; i ++) {
			printf("%d%c", ans[i][j], (i<m?' ':'\n'));
		}
	}
	return 0;
}
