#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef complex<double> base;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define mp(a, b) make_pair((a), (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";

template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}



void smain();

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(12) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}
struct edge {
    int from, to, cap, flow;
};
const int N = 1000, oo = 1e9 + 10;
struct Dinic {
    vi g[N];
    vector<edge> e;

    void add_edge(int from, int to, int cap) {
        g[from].push_back(e.size());
        e.push_back({from, to, cap, 0});
        g[to].push_back(e.size());
        e.push_back({to, from, 0, 0});
    }

    int d[N], q[N + N], ptr[N];

    bool bfs(int s, int t) {
        int ql, qr;
        ql = qr = 0;
        q[qr++] = s;
        d[s] = 0;
        while (ql < qr) {
            int v = q[ql++];
            for (int id : g[v]) {
                int to = e[id].to;
                if (d[to] == -1 && e[id].cap > e[id].flow) {
                    d[to] = d[v] + 1;
                    q[qr++] = to;
                }
            }
        }
        return d[t] != -1;
    }

    int dfs(int v, int fin, int flow) {
        if (!flow || fin == v)
            return flow;
        for (; ptr[v] < (int) g[v].size(); ++ptr[v]) {
            int id = g[v][ptr[v]];
            int to = e[id].to;
            if (d[to] != d[v] + 1)
                continue;
            int pushed = dfs(to, fin, min(flow, e[id].cap - e[id].flow));
            if (pushed) {
                e[id].flow += pushed;
                e[id ^ 1].flow -= pushed;
                return pushed;
            }
        }
        return 0;
    }

    int dinic(int s, int t) {
        int flow = 0;
        while (true) {
            fill(d, d + t + 1, -1);
            fill(ptr, ptr + t + 1, 0);
            if (!bfs(s, t))
                return flow;
            while (int pushed = dfs(s, t, oo)) {
                flow += pushed;
            }
        }
    }
};


void smain() {
    int n, m;
    cin >> n >> m;
    vvi a(n, vi(m));
    fori (i, n) {
        fori (j, m) {
            cin >> a[i][j];
            --a[i][j];
            cerr << a[i][j] << ' ';
        }
        cerr << '\n';
    }
    cerr << "\n\n\n\n\n";
    vvs used(n, vs(m, false));
    vvi b(n, vi(m));

    fori (j, m) {
        Dinic dinic;
        int s = n + n;
        int t = s + 1;
        fori (x, n) {
            fori (y, m) {
                if (used[x][y])
                    continue;
                dinic.add_edge(x, n + a[x][y] / m, 1);
            }
        }
        fori (x, n) {
            dinic.add_edge(s, x, 1);
            dinic.add_edge(n + x, t, 1);
        }
        int flow = dinic.dinic(s, t);
        if (flow != n) {
            assert(0);
        }
        vi ch(n);
        fori (i, n) {
            for (auto id : dinic.g[i]) {
                if (dinic.e[id].flow == 1) {
                    ch[i] = dinic.e[id].to - n;
                }
            }
        }
        fori (i, n) {
            bool ok = false;
            fori (jj, m) {
                if (!ok && !used[i][jj] && a[i][jj] / m == ch[i]) {
                    used[i][jj] = true;
                    ok = true;
                    b[i][j] = a[i][jj];
                }
            }
            assert(ok);
        }
    }

    fori (i, n) {
        fori (j, m) {
            cout << b[i][j] + 1 << ' ';
        }
        cout << '\n';
    }
    cout << "\n\n\n";
    vvi c(n, vi(m));
    fori (j, m) {
        vi cur;
        fori (i, n) {
            cur.push_back(b[i][j]);
        }
        sort(ALL(cur));
        fori (i, n) {
            c[i][j] = cur[i];
        }
    }
    fori (i, n) {
        fori (j, m) {
            cout << c[i][j] + 1 << ' ';
        }
        cout << '\n';
    }
}

Measured memory_bytes: 1296