#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
const int MX = 200005;
typedef v(vp) vvp;
typedef v(vvi) vvvi;

// bipartite matching
struct match {
  vi pre, root;
  vvi to;
  vi p, q;
  int n, m;
  match(int n, int m):pre(n,-1),root(n,-1),to(n),p(n,-1),q(m,-1),n(n),m(m){}
  void add(int a, int b) { to[a].pb(b);}
  int solve() {
    int res = 0;
    bool upd = true;
    while (upd) {
      upd = false;
      queue<int> s;
      rep(i,n) if (!~p[i]) {
        root[i] = i;
        s.push(i);
      }
      while (sz(s)) {
        int v = s.front(); s.pop();
        if (~p[root[v]]) continue;
        rep(i,sz(to[v])) {
          int u = to[v][i];
          if (!~q[u]) {
            while (~u) {
              q[u] = v;
              swap(p[v],u);
              v = pre[v];
            }
            upd = true;
            ++res;
            break;
          }
          u = q[u];
          if (~pre[u]) continue;
          pre[u] = v; root[u] = root[v];
          s.push(u);
        }
      }
      if (upd) fill(rng(pre),-1), fill(rng(root),-1);
    }
    return res;
  }
};

void output(vvi a) {
  rep(i,sz(a)) cout<<a[i]<<endl;
}

int main() {
  int h,w;
  scanf("%d%d",&h,&w);
  vvi a(h,vi(w));
  cin>>a;
  {
    vvvi ps(h,vvi(h));
    rep(i,h)rep(j,w) {
      int g = (a[i][j]-1)/w;
      ps[g][i].pb(a[i][j]);
    }
    vvi b(h,vi(w));
    rep(j,w) {
      match g(h,h);
      rep(k,h)rep(i,h) if (sz(ps[k][i])) g.add(i,k);
      assert(g.solve() == h);
      rep(i,h) {
        int k = g.p[i];
        b[i][j] = ps[k][i].back();
        ps[k][i].pop_back();
      }
    }
    output(b);
    a = b;
  }
  {
    rep(i,w) {
      vi s;
      rep(j,h) s.pb(a[j][i]);
      sort(rng(s));
      rep(j,h) a[j][i] = s[j];
    }
    output(a);
  }
  return 0;
}






















Measured memory_bytes: 1024