#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
 
long long int INF = 100000000;
double Pi = 3.1415926535897932384626;
 
//vector<ll> G[550010];
//vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//ll bit[500005];
//↓,→,↑,←
 
 
#define p(x) cout<<x<<"\n";
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)(); 
 
 
ll mod = 998244353;
/*
2000000011 is prime
2000000033 is prime
*/

ll rui(ll number1,ll number2){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){
 
    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){
 
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
 
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}

/*
ll fact[800005],rfact[800005];

void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=800000; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[800000] = rui(fact[800000],mod - 2);
    for(ll i=800000; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod) * rfact[n-r]) % mod;}
*/
 
ll n,m,num,sum,a,b,c,d,e,g,h,w,i,j,q,r;
ll k,ans;
ll x[500005],y[500005],z[500005];
char s[500005];
ll dp[105][105];
ll dp2[105][105];

struct edge {int to,cap,rev; } ;

vector<edge> G[505];
bool used[505];
bool akan[505][505];

void add_edge(int from,int to, int cap){
    //pe(from);p(to);
    G[from].pb((edge){to,cap,(int)G[to].size()});
    G[to].pb((edge){from,0,(int)G[from].size() - 1});
}

int dfs(int v,int t,int f){
    if(v == t)return f;
    used[v] = true;
    for(int i=0;i<G[v].size();i++){
        edge &e = G[v][i];
        if(!used[e.to] && e.cap > 0){
            int d = dfs(e.to,t,min(f,e.cap));
            if(d > 0){
                e.cap -= d;
                G[e.to][e.rev].cap += d;
                return d;
            }
        }
    }
    return 0;
}

int max_flow(int s,int t){
    int flow = 0;
    for(;;){
        memset(used,0,sizeof(used));
        int f = dfs(s,t,INF);
        if(f == 0)return flow;
        flow += f;
    }
}

void swap_edge(ll i,ll idx,ll j){
    dp2[i][idx] = dp[i][j+1];
    return;
}

int main(){
    cin >> n >> m;
    for(i=0;i<n;i++){
        for(j=0;j<m;j++){
            cin >> x[j];
            dp[i+1][j+1] = x[j];
            dp2[i+1][j+1] = x[j];
            //add_edge(i+1,((x[j] + m - 1) / m) + 100,1);
        }
    }
    

    ll idx = 1;
    while(1){
        
        for(i=1;i<=n;i++){
            for(j=1;j<=m;j++){
                if(!akan[i][j-1]){
                    add_edge(i,((dp[i][j] + m - 1) / m) + 100,1);
                }else{
                    add_edge(i,((dp[i][j] + m - 1) / m) + 100,0);
                }
            }
        }
        for(i=0;i<n;i++){
            add_edge(201,i+1,1);
        }
        for(i=0;i<n;i++){
            add_edge(i+101,202,1);
        }
        a = max_flow(201,202);
        //pe("flow = ");p(a);
        for(i=1;i<=n;i++){
            for(j=0;j<m;j++){
                if(G[i][j].cap == 0 && !akan[i][j]){
                    akan[i][j] = true;
                    //pe(j);p(G[i].size());
                    swap_edge(i,idx,j);
                    break;
                }
            }
            
        }
        idx++;
        
        if(idx == m + 1)break;
        for(i=1;i<=n;i++){
            G[i].clear();
            G[i+100].clear();
        }
        G[201].clear();
        G[202].clear();
    }
    for(i=1;i<=n;i++){
        for(j=1;j<=m;j++){
            pe(dp2[i][j]);
        }
        el;
    }
    for(j=1;j<=m;j++){
        for(ll i1=1;i1<=n;i1++){
            for(ll i2=1;i2<i1;i2++){
                if(dp2[i2][j] > dp2[i1][j]){
                    swap(dp2[i2][j],dp2[i1][j]);
                }
            }
        }
    }
    for(i=1;i<=n;i++){
        for(j=1;j<=m;j++){
            pe(dp2[i][j]);
        }
        el;
    }
    
    
    return 0;
}






Measured memory_bytes: 2944