#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
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;
}
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __Setup;

using ll = long long;
#define OVERLOAD3(_1, _2, _3, name, ...) name
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define REP1(i, n) for(int i = 0; i < int(n); i++)
#define REP2(i, a, b) for(int i = (a); i < int(b); i++)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define REVERSE(v) reverse(ALL(v))
#define SZ(v) ((int)(v).size())
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
constexpr int MOD2 = 998244353;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

void Case(int i) { cout << "Case #" << i << ": "; }
int popcount(int x) { return __builtin_popcount(x); }
ll popcount(ll x) { return __builtin_popcountll(x); }
#pragma endregion Macros

#include <atcoder/maxflow>

void solve() {
    int N, M;
    cin >> N >> M;
    vector a(N, vector<int>(N));
    REP(i, N) REP(j, N) cin >> a[i][j];
    REP(i, N) if(accumulate(ALL(a[i]), 0) != M) {
        cout << "-1\n";
        return;
    }
    REP(j, N) {
        int sum = 0;
        REP(i, N) sum += a[i][j];
        if(sum != M) {
            cout << "-1\n";
            return;
        }
    }
    vector P(M, vector<int>(N));
    // 列c に置く数を決める
    REP(c, N) {
        atcoder::mf_graph<int> mf(M + N + 2);
        int S = M + N, T = S + 1;
        REP(i, M) mf.add_edge(S, i, 1);
        REP(i, N) if(a[c][i] > 0) mf.add_edge(M + i, T, a[c][i]);
        REP(i, M) {
            REP(num, 1, N+1) {
                bool ok = true;
                REP(j, c) {
                    if(P[i][j] == num) {
                        ok = false;
                        break;
                    }
                }
                if(ok) mf.add_edge(i, M + num - 1, 1);
            }
        }
        int fl = mf.flow(S, T);
        if(fl != M) {
            cout << "-1\n";
            return;
        }
        for(const auto& e : mf.edges()) {
            if(0 <= e.from and e.from < M and M <= e.to and e.to < M + N and e.flow == 1) {
                P[e.from][c] = e.to + 1 - M;
            }
        }
    }
    REP(i, M) {
        REP(j, N) {
            assert(1 <= P[i][j] and P[i][j] <= N);
            cout << P[i][j] << " \n"[j == N-1];
        }
    }
}

int main() {
    solve();
}