#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
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; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;
using pint = pair<lint, vi>;
using vp = vector<pint>;

int main() {
	lint N, M;
	cin >> N >> M;
	vvi v(N, vi(N));
	rep(i, N) vin(v[i]);

	lint a=0, b=0, c=0, x, y, z;
	rep(i, N) {
		a = 0;
		rep(j, N) {
			a += v[i][j];
		}
		if (a != M) drop(-1);
	}
	rep(j, N) {
		a = 0;
		rep(i, N) {
			a += v[i][j];
		}
		if (a != M) drop(-1);
	}
	vp p(N);
	rep(i, N) p[i] = {i, v[i]};
	rep(_, M) {
		sort(all(p), greater());
		set<lint> s;
		vi t(N);
		rep(i, N) {
			rep(j, N) {
				if (!s.count(p[j].first) && p[j].second[i]) {
					t[p[j].first] = i+1;
					s.insert(p[j].first);
					p[j].second[i]--;
					break;
				}
			}
		}
		vout(t);
	}
}