#line 1 "2263.cpp"
// #pragma GCC target("avx2,avx512f,avx512vl,avx512bw,avx512dq,avx512cd,avx512vbmi,avx512vbmi2,avx512vpopcntdq,avx512bitalg,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("Ofast")

#line 2 "/home/sigma/comp/library/template.hpp"

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb push_back
#define eb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> bool chmax(T& x, U y){
	if(x<y){ x=y; return true; }
	return false;
}
template<class T,class U> bool chmin(T& x, U y){
	if(y<x){ x=y; return true; }
	return false;
}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class T>
V<T> Vec(size_t a) {
    return V<T>(a);
}
template<class T, class... Ts>
auto Vec(size_t a, Ts... ts) {
  return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));
}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif

template<class D> D divFloor(D a, D b){
	return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}
template<class D> D divCeil(D a, D b) {
	return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}
#line 5 "2263.cpp"

V<int> bipartite_edge_coloring(int N, V<pair<int,int>> es){
	using P = pair<int,int>;
	int M = es.size();
	int D = 0;
	{
		V<int> d(N);
		for(P e:es) d[e.fs]++,d[e.sc]++;
		rep(i,N) chmax(D,d[i]);
	}
	VV<int> vc2e(N,V<int>(D,-1));
	V<int> col(M,-1);
	auto color = [&](int e,int c){
		int x = es[e].fs, y = es[e].sc;
		if(col[e] != -1){
			vc2e[x][col[e]] = -1;
			vc2e[y][col[e]] = -1;
		}
		col[e] = c;
		vc2e[x][c] = e, vc2e[y][c] = e;
	};
	V<int> buf(M);
	rep(t,M){
		int x = es[t].fs, y = es[t].sc;
		int c0 = 0, c1 = 0;
		while(vc2e[x][c0] != -1) c0++;
		while(vc2e[y][c1] != -1) c1++;
		if(c0 == c1){
			color(t,c0);
			continue;
		}
		int v = x, c = c1, I = 0;
		while(vc2e[v][c] != -1){
			int e = vc2e[v][c];
			v ^= es[e].fs^es[e].sc;
			c ^= c0^c1;
			buf[I++] = e;
		}
		v = x;
		rep(i,I){
			int e = buf[i];
			col[e] ^= c0^c1;
			swap(vc2e[v][c0],vc2e[v][c1]);
			v ^= es[e].fs^es[e].sc;
		}
		swap(vc2e[v][c0],vc2e[v][c1]);
		color(t,c1);
	}
	return col;
}


int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);

	int N,M; cin >> N >> M;
	using P = pair<int,int>;
	V<P> es;
	rep(i,N) rep(j,N){
		int a; cin >> a;
		rep(_,a) es.eb(i,j+N);
	}
	auto col = bipartite_edge_coloring(N+N,es);
	int C = *max_element(all(col))+1;
	if(C != M){
		cout << -1 << endl;
		return 0;
	}
	VV<int> ans(M,V<int>(N,-1));
	rep(i,si(col)){
		ans[col[i]][es[i].fs] = es[i].sc-N;
	}
	rep(i,M){
		rep(j,N) cout << ans[i][j]+1 << " ";
		cout << endl;
	}
}