#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
ld pie=3.141592653589793;
ll mod=1000000007;
ll inf=9999999999999999;
int main(){
    ll n,m;
    cin >> n >> m;
    vector<vector<ll>>a(n,vector<ll>(n));
    for (ll i = 0; i < n; i++)
    {
        for (ll j = 0; j < n; j++)
        {
            cin >> a[i][j];
        }
    }
    bool ok=true;
    for (ll i = 0; i < n; i++)
    {
        ll x=0;
        for (ll j = 0; j < n; j++)
        {
            x+=a[i][j];
        }
        if (x!=m)
        {
            ok=false;
        }
    }
    for (ll i = 0; i < n; i++)
    {
        ll x=0;
        for (ll j = 0; j < n; j++)
        {
            x+=a[j][i];
        }
        if (x!=m)
        {
            ok=false;
        }
    }
    if (!ok)
    {
        cout << -1 << endl;
        return 0;
    }
    vector<vector<ll>>p(m,vector<ll>(n,-1));
    for (ll i = 0; i < n; i++)
    {
        for (ll j = 0; j < n; j++)
        {
            for (ll k = 0; k < a[i][j]; k++)
            {
                if (i%2)
                {
                for (ll l = 0; l < m; l++)
                {
                    if (p[l][i]==-1)
                    {
                        bool ok=true;
                        for (ll q = 0; q < i; q++)
                        {
                            if (p[l][q]==j+1)
                            {
                                ok=false;
                                break;
                            }
                        }
                        if (ok)
                        {
                            p[l][i]=j+1;
                            break;
                        }
                    }
                }
                }else{
                for (ll l = m-1; l >=0; l--)
                {
                    if (p[l][i]==-1)
                    {
                        bool ok=true;
                        for (ll q = 0; q < i; q++)
                        {
                            if (p[l][q]==j+1)
                            {
                                ok=false;
                                break;
                            }
                        }
                        if (ok)
                        {
                            p[l][i]=j+1;
                            break;
                        }
                    }
                }
                }
            }
        }
    }
    for (ll i = 0; i < m; i++)
    {
        for (ll j = 0; j < n; j++)
        {
            cout << p[i][j] << ' ';
        }
        cout << endl;
    }
    
}