#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
template<typename T> bool chmax(T& x, const T& y){return (x<y)?(x=y,true):false;};
template<typename T> bool chmin(T& x, const T& y){return (x>y)?(x=y,true):false;};
constexpr ll MOD=998244353;
constexpr ll INF=2e18;

int main(){
    int n, m; cin >> n >> m;
    VVI a(n,VI(n));
    REP(i,n)REP(j,n) cin >> a[i][j];
    REP(i,n){
        int sum=0;
        REP(j,n) sum+=a[i][j];
        if(sum!=m){
            cout << -1 << endl;
            return 0;
        }
        sum=0;
        REP(j,n) sum+=a[j][i];
        if(sum!=m){
            cout << -1 << endl;
            return 0;
        }
    }
    VVI ans(m,VI(n));
    REP(i,m) iota(ALL(ans[i]),0);
    REP(i,n){
        VI f(m,0);
        REP(j,n){
            REP(k,m){
                if(a[i][j]==0)
                    break;
                if(f[k])
                    continue;
                for(int l=i;l<n;l++){
                    if(ans[k][l]==j){
                        swap(ans[k][i],ans[k][l]);
                        a[i][j]--;
                        f[k]=1;
                        break;
                    }
                }
            }
        }
    }
    REP(i,m)REP(j,n) cout << ans[i][j]+1 << " \n"[j==n-1];
}