#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/maxflow>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, m; cin >> n >> m;
    auto a = vec2d(n, n, 0);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            cin >> a[i][j];
        }
    }
    for(int i = 0; i < n; i++){
        int sum = 0;
        for(int j = 0; j < n; j++){
            sum += a[i][j];
        }
        if(sum != m){
            cout << -1 << endl;
            return 0;
        }
    }
    for(int j = 0; j < n; j++){
        int sum = 0;
        for(int i = 0; i < n; i++){
            sum += a[i][j];
        }
        if(sum != m){
            cout << -1 << endl;
            return 0;
        }
    }
    vector<vector<int>> ans;
    int rem = m;
    auto row_idx = [&](int i){
        return i+1;
    };
    auto col_idx = [&](int i){
        return i+n+1;
    };
    int s = 0, t = 2*n+1;
    while(rem--){
        atcoder::mf_graph<int> mf(2+2*n);
        for(int i = 0; i < n; i++){
            mf.add_edge(s, row_idx(i), 1);
            mf.add_edge(col_idx(i), t, 1);
            for(int j = 0; j < n; j++){
                if(a[i][j] > 0){
                    mf.add_edge(row_idx(i), col_idx(j), 1);
                }
            }
        }
        int f = mf.flow(s, t);
        assert(f == n);
        vector<int> v(n, -1);
        for(auto e: mf.edges()){
            if(e.flow == 0) continue;
            if(row_idx(0) <= e.from && e.from <= row_idx(n-1) && col_idx(0) <= e.to && e.to <= col_idx(n-1)){
                int i = e.from-1, j = e.to-(n+1);
                if(v[i] == -1){
                    v[i] = j;
                    a[i][j]--;
                }
            }
        }
        ans.push_back(v);
    }
    for(auto u: ans) {
        for(int x: u) cout << x+1 << ' ';
        cout << endl;
    }
}