#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  VVI a(n, VI(n));
  rep(i, n) rep(j, n) cin >> a[i][j];
  rep(j, n) {
    int cnt = 0;
    rep(i, n) cnt += a[i][j];
    if (cnt != m) {
      cout << -1 << '\n';
      return 0;
    }
  }
  VI ans(n);
  rep(i, m) {
    int s = 2 * n, t = s + 1;
    mf_graph<int> g(t + 1);
    rep(i, n) g.add_edge(s, i, 1);
    rep(i, n) rep(j, n) if (a[j][i]) g.add_edge(i, j + n, 1);
    rep(j, n) g.add_edge(j + n, t, 1);
    int f = g.flow(s, t);
    assert(f == n);
    for(auto e: g.edges()) if (e.flow && e.from < n) {
      ans[e.to - n] = e.from;
      a[e.to - n][e.from]--;
    }
    rep(i, n) cout << ans[i] + 1 << " \n"[i + 1 == n];
  }
}