#include <bits/stdc++.h>

#define SZ(x) (((int)x.size()))

using namespace std;

const int maxn = 110;
int n, m, val, a[maxn][maxn], mat[maxn];
bool mark[maxn];
vector<int> vec[maxn][maxn], tmp;
unordered_set<int> adj[maxn];

bool dfs(int x)
{
	if (mark[x])
		return 0;
	mark[x] = 1;
	for (auto u : adj[x])
	{
		if (mat[u] == -1 || dfs(mat[u]))
		{
			mat[u] = x;
			return 1;
		}
	}
	return 0;
}

int main()
{
	cin >> n >> m;
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			cin >> val;
			val--;
			vec[i][val / m].push_back(val + 1);
			adj[val / m].insert(i);
		}
	}
	for (int i = 0; i < m; i++)
	{
		memset(mat, -1, sizeof mat);
		for (int j = 0; j < n; j++)
		{
			memset(mark, 0, sizeof mark);
			dfs(j);
		}
		for (int j = 0; j < n; j++)
		{
			a[j][i] = vec[j][mat[j]].back();
			vec[j][mat[j]].pop_back();
			if (SZ(vec[j][mat[j]]) == 0)
				adj[mat[j]].erase(j);
		}
	}
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
			cout << a[i][j] << " ";
		cout << endl;
	}
	for (int i = 0; i < m; i++)
	{
		tmp.clear();
		for (int j = 0; j < n; j++)
			tmp.push_back(a[j][i]);
		sort(tmp.begin(), tmp.end());
		for (int j = 0; j < n; j++)
			a[j][i] = tmp[j];
	}
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
			cout << a[i][j] << " ";
		cout << endl;
	}
	return 0;
}
