#include <bits/stdc++.h>
#include "unistd.h"
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i<i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formax=(b);i>=i##formax;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)
#define show(x) cout<<#x<<" = "<<x<<endl;
#define all(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))
#define bitComb(a,n,k) for(int a##x,a##y,a=(1<<k)-1;a<(1<<n);a##x=a&-a,a##y=a+a##x,a=(((a&~a##y)/a##x)>>1)|a##y)
#define bit(n) (1LL<<(n))
#define randInt(l,r) (uniform_int_distribution<ll>(l,r)(rnd))
#define randDouble(l,r) (uniform_real_distribution<double>(l,r)(rnd))
#define dout(d) printf("%.12f\n",d)

typedef long long ll;
typedef __int128_t lll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T>using V=vector<T>;
template<class T>using VV=V<V<T>>;
template<class T,class Y>ostream& operator<<(ostream&o,const pair<T,Y>&p){return o<<"("<<p.fi<<","<<p.se<<")";}
template<class T>ostream& operator<<(ostream&o,V<T>&v){for(T&t:v)o<<t<<",";return o<<endl;}
template<typename A,size_t N,typename T>void Fill(A (&array)[N],const T&v){fill((T*)array,(T*)(array+N),v);}
template<typename T>void uniq(V<T>&v){sort(all(v));v.erase(unique(all(v)), v.end());}
lll gcd(lll a,lll b,lll &x,lll &y){if(!b){x=1;y=0;return a;}lll d=gcd(b,a%b,y,x);y-=a/b*x;return d;}
ll modInv(ll a,ll m){lll x,y;gcd(a,m,x,y);return (x%m+m)%m;}
ll modPow(lll a,lll n,ll m){if(!a)return a;lll p=1;for(;n>0;n>>=1,a=a*a%m)if(n&1)p=p*a%m;return(ll)p;}
bool isPrime(ll n){if(n<2||n%2==0)return n==2;lll t=n-1,d=t/(t&-t);for(lll a:{2,325,9375,28178,450775,9780504,1795265022})if(a%n){for(t=d,a=modPow(a,t,n);t!=n-1&&a!=1&&a!=n-1;a=a*a%n,t=t*2%n);if(a!=n-1&&t%2==0)return 0;}return 1;}
//V<ll>fac,rfac;void setFac(int n,int mod){fac=rfac=V<ll>(++n);fac[0]=1;FOR(i,1,n)fac[i]=fac[i-1]*i%mod;rfac[n-1]=modInv(fac[n-1],mod);FORR(i,n-1,1)rfac[i-1]=rfac[i]*i%mod;}
const int IINF = 1e9+6;
const ll LINF = 1e18;
const int MOD = 1e9+7;
const double PI = acos(-1);
const double EPS = 1e-10;
static random_device rd;
static mt19937 rnd(rd());
void RE(){cout<<1/0;}
void TLE(){sleep(100);}
void WA(){cout<<"char134217728";exit(0);}

const int N = 100;
struct BM {
  int L, R;
  vector<vector<int>> adj;
  vector<int> level, mate;
  void init(int l, int r){
    L = l, R = r;
    adj = vector<vector<int>>(L+R);
    level = vector<int>(L);
    mate = vector<int>(L+R, -1);
  }
  void add_edge(int u, int v) {
    adj[u].push_back(v+L);
    adj[v+L].push_back(u);
  }
  int maximum_matching() {
    function<bool(void)> levelize = [&](){
      queue<int> Q;
      for(int u=0; u<L; u++){
        level[u] = -1;
        if(mate[u] < 0) {
          level[u] = 0;
          Q.push(u);
        }
      }
      while (!Q.empty()) {
        int u = Q.front();
        Q.pop();
        for(int w: adj[u]) {
          int v = mate[w];
          if(v < 0) return true;
          if(level[v] < 0) {
            level[v] = level[u] + 1;
            Q.push(v);
          }
        }
      }
      return false;
    };
    function<bool(int)> augment = [&](int u) {
      for(int w: adj[u]) {
        int v = mate[w];
        if(v < 0 || (level[v] > level[u] && augment(v))){
          mate[u] = w;
          mate[w] = u;
          return true;
        }
      }
      return false;
    };
    int match = 0;
    while(levelize()) for(int u=0; u<L; u++) if (mate[u] < 0 && augment(u)) match++;
    return match;
  }
} bm;

int n, m;
queue<int> a[N][N];
int ans[N][N];
int c[N][N];
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> m;
  FOR(i, 0, n) FOR(j, 0, m){
    int x, y;
    cin >> x;
    x--;
    y = x/m;
    a[i][y].push(x);
    c[i][y]++;
  }
  FOR(i, 0, m){
    bm.init(n, n);
    FOR(j, 0, n)FOR(k, 0, n) if(c[j][k]) bm.add_edge(j, k);
    assert(bm.maximum_matching()==n);
    FOR(j, 0, n){
      int k = bm.mate[j]-bm.L;
      ans[j][i] = a[j][k].front();
      a[j][k].pop();
      c[j][k]--;
    }
  }
  FOR(i, 0, n) FOR(j, 0, m) cout << ans[i][j]+1 << (j==m-1 ? '\n' : ' ');
  FOR(i, 0, m){
    V<int> v;
    FOR(j, 0, n) v.pb(ans[j][i]);
    sort(all(v));
    FOR(j, 0, n) ans[j][i] = v[j];
  }
  FOR(i, 0, n) FOR(j, 0, m) cout << ans[i][j]+1 << (j==m-1 ? '\n' : ' ');
}

Measured memory_bytes: 7296