#include #include #define ep emplace #define eb emplace_back #define all(a) begin(a),end(a) #define wh(...) while(__VA_ARGS__) #define ef(...) else if(__VA_ARGS__) #define done(...) rr pp(__VA_ARGS__) #define LL(...) RD(ll,__VA_ARGS__) #define ST(...) RD(str,__VA_ARGS__) #define RD(T,...) T __VA_ARGS__;li(__VA_ARGS__) #define UL(n,...) u1 __VA_ARGS__;resize({n},__VA_ARGS__);li(__VA_ARGS__) #define UV(n,...) u1 __VA_ARGS__;resize({n},__VA_ARGS__);vi(__VA_ARGS__) #define SS(n,...) strs __VA_ARGS__;resize({n},__VA_ARGS__);li(__VA_ARGS__) #define U2(n,m,...) u2 __VA_ARGS__;resize({n,m},__VA_ARGS__);li(__VA_ARGS__) #define inner_fe(v,e,...) for(au&&__VA_OPT__([)e __VA_OPT__(,__VA_ARGS__)__VA_OPT__(]):v) #define fe(...) inner_fe(__VA_ARGS__) #define inner_fo(n) for(ll join(__,__LINE__)=n;join(__,__LINE__)-->0;) #define inner_for(i,...) for(au[i,i##stop,i##step]=rng_fo(0,__VA_ARGS__);i=i##stop;i-=i##step) #define debug(...) pp(#__VA_ARGS__,__VA_ARGS__) #define join(s,t) inner_join(s,t) #define inner_join(s,t) s##t #define I(...) template<__VA_ARGS__> #define J typename #define O operator #define au auto #define cs const #define ifc if constexpr #define rr return #define uu using namespace my{uu vo=void;vo main();vo solve();}int main(){my::main();}namespace my{uu namespace std;uu is=istream;uu os=ostream; uu bo=bool;uu dd=long double;uu ll=long long;uu ull=unsigned long long;uu lll=__int128_t;uu ulll=__uint128_t;I(J T)uu vt=J T::value_type; I(J T)uu ilis=initializer_list;I(J T)uu v1=vector;I(J T)uu v2=v1>;uu u1=v1;uu u2=v2;uu str=string;uu strs=v1; uu namespace atcoder;uu ml=modint998244353;is&O>>(is&i,ml&x){ll t;i>>t;x=t;rr i;}os&O<<(os&o,cs ml&x){rr o<; I(J A,J B=A)struct cp{A a={};B b={};cp(){}cp(A a,B b):a(a),b(b){}cp(pairp):a(p.first),b(p.second){}cp O-()cs{rr cp(-a,-b);} cp&O+=(cs cp&c){a+=c.a,b+=c.b;rr*this;}cp O+(cs cp&c)cs{rr cp{*this}+=c;}bo O<(cs cp&c)cs{rr a!=c.a?a(cs cp&c)cs{rr a!=c.a?a>c.a:b>c.b;} bo O==(cs cp&c)cs{rr a==c.a&&b==c.b;} };uu cl=cp;uu cls=v1;I(J T)uu qmax=priority_queue;I(J T)uu qmin=priority_queue,greater<>>;I(J T)T sq(T a){rr a*a;} I(J T)struct set:std::set{set(v1a={}){fe(a,e)this->ep(e);}};I(J T)struct uset:unordered_set{uset(v1a={}){fe(a,e)this->ep(e);}}; I(J T)struct mset:multiset{mset(v1a={}){fe(a,e)this->ep(e);}vo erase(cs T&x){if(this->contains(x))multiset::erase(this->find(x));}}; I(J T,J U=T)uu map=std::map;I(J T,J U=T)uu umap=unordered_map;str Yes(bo y=1){rr y?"Yes":"No";}str No(){rr Yes(0);} ll oo=3e18;dd ee=1e-12;u1 dx{-1,0,1,0,-1,1,1,-1},dy{0,-1,0,1,-1,-1,1,1};str sp=" ",nc="",nl="\n";I(J T)ll len(cs T&a){rr a.size();} ll rnd(ll l,ll r=oo){static ull x=76,y=53,z=20,w=41;ull t=x^(x<<11);x=y,y=z,z=w,w=(w^(w>>19))^(t^(t>>8));if(r==oo)r=l,l=0;rr w%(r-l)+l;} ll l2(ulll x){x|=1;ll r=0;wh(x)x>>=1,++r;rr r;}bo odd(ll x){rr x&1;}ll pwm1(ll x){rr 1-2*(x&1);}I(J T)bo at(T x,ll i){rr x>>i&1;} ll l10(ulll x){x|=1;ll r=0;wh(x)x/=10,++r;rr r;}bo eve(ll x){rr~x&1;}ll pw2(ll n){rr 1LL<=0?x/y:(x+1)/y-1;}arrayrng_fo(bo s,ll a,ll b=oo,ll c=1){if(b==oo)b=a,a=0;rr{a,b-s,c};} I(J T)T cei(T x,T y){rr y<0?x=-x,y=-y:x<=0?x/y:(x-1)/y+1;}I(J T)T zz(T x){rr x<0?-x:x;}I(J T)bo add(T&a,cs T&b){rr a+=b;} I(J T)au&O+=(v1&v,cs v1&u){fo(i,len(v))v[i]+=u[i];rr v;}I(J T)au O+(v1v,cs v1&u){rr v+=u;}I(J T)constexpr bo isv=0; I(J T)au&O-=(v1&v,cs v1&u){fo(i,len(v))v[i]-=u[i];rr v;}I(J T)au O-(v1v,cs v1&u){rr v-=u;}I(J T)constexpr bo isv> =1; I(J T,J U)au&O+=(v1&v,cs U&x){fe(v,e)e+=x;rr v;}I(J T,J U)au O+(v1v,cs U&x){rr v+=x;}I(J T)au&O++(v1&v){rr v+=1;} I(J T,J U)au&O-=(v1&v,cs U&x){fe(v,e)e-=x;rr v;}I(J T,J U)au O-(v1v,cs U&x){rr v-=x;}I(J T)au&O--(v1&v){rr v-=1;} I(J T)au&O^=(v1&v,cs v1&u){fe(u,e)v.eb(e);rr v;}I(J T)au O^(v1v,cs v1&u){rr v^=u;}I(J T)vo af(T&a,vte={}){a.ep(begin(a),e);} I(J T,J F=less<>)T&srt(T&a,F f={}){sort(all(a),f);rr a;}I(J T)T&rv(T&a){reverse(all(a));rr a;}I(J T)vo df(T&a){a.erase(begin(a));} I(J T)T&rsr(T&a){rr rv(srt(a));}I(J T)T&uq(T&a){srt(a).erase(unique(all(a)),end(a));rr a;}u1 io(ll n,ll x=0){u1 a;fo(i,n)a.eb(i+x);rr a;} I(J T)decltype(au)bg(T&a){rr*begin(a);}I(J T)au pof(T&q){au r=bg(q);q.pop_front();rr r;}I(J T,J U)bo amax(T&a,cs U&b){rr ab?a=b,1:0;} I(J T)decltype(au)rb(T&a,ll x){rr*(rbegin(a)+x);}I(J T)au pop(T&a){ifc(isv)rr pob(a);else{au r=a.top();a.pop();rr r;}} I(J...A)au max(cs A&...a){rr max(ilis>{a...});}I(J T,J U)ll arglb(cs v1&v,cs U&x){rr lower_bound(all(v),x)-begin(v);} I(J...A)au min(cs A&...a){rr min(ilis>{a...});}I(J T,J U)ll argub(cs v1&v,cs U&x){rr upper_bound(all(v),x)-begin(v);} I(J T=ll,ll n,ll i=0)au vec(cs ll(&l)[n],T x={}){ifc(n==i+1)rr v1(l[i],x);else rr vector(l[i],vec(l,x));} I(J S,bo f(S&,cs S&),J V)au scan(cs V&v){cpr;ifc(!isv)r={v,1};else fe(v,x)if(au t=scan(x);t.b)!r.b?r=t,0:f(r.a,t.a);rr r;} I(J V)au pv(V){ifc(isv)rr pv(vt());else rr V();}I(J V)uu pt=decltype(pv(V()));I(J V)au sum(cs v1&v){rr scan,add>(v).a;} I(J V)au zt(V v){ifc(isv){fe(v,e)e=zt(e);fo(i,len(v)-1)v[i+1]+=v[i];}rr v;}I(J V)au max(cs v1&v){rr scan,amax>(v).a;} I(J V)au mb(V v){ifc(isv){fe(v,e)e=mb(e);of(i,len(v)-1)v[i+1]-=v[i];}rr v;}I(J V)au min(cs v1&v){rr scan,amin>(v).a;} I(J V)vo fill(v1&v,ptx={}){fe(v,e)ifc(isv)fill(e,x);else e=x;}I(ll n,J...A)vo resize(cs ll(&l)[n],A&...a){((a=vec(l,pv(a))),...);} struct fio{fio(){cin.tie(0)->sync_with_stdio(0);cout<&v){str s=nl;ifc(!isv)s=sp;else ifc(isv>)s+=nl;fe(v,e)o<&v){fe(v,e)o<&c){rr o<&v){fe(v,e)o<&m){fe(m,e)o<&v){fe(v,e)o<>(is&i,v1&v){fe(v,e)i>>e;rr i;}I(J...A)vo li(A&...a){(cin>>...>>a);}I(J...A)vo vi(A&...a){fo(i,(len(a)&...))(cin>>...>>a[i]);} struct edg{ll t,w;edg(){}edg(ll t,ll w=1):t(t),w(w){}};uu graph=v2; graph tog(cs u2&a){graph g;fe(a,e){g.eb();fe(e,v)rb(g).eb(v);}rr g;}u2 tou(cs graph&g){u2 a;fe(g,e){a.eb();fe(e,v,w)rb(a).eb(v);}rr a;} I(J G)au ygi(G&g,ll m,bo f=1){ifc(is_same_v){UV(m,a,b);a-=f,b-=f;fo(i,m)g[a[i]].eb(b[i]);rr tuple{a,b};} else{UV(m,a,b,c);a-=f,b-=f;fo(i,m)g[a[i]].eb(b[i],c[i]);rr tuple{a,b,c};}} I(J G)au mgi(G&g,ll m,bo f=1){ifc(is_same_v){au[a,b]=ygi(g,m,f);fo(i,m)g[b[i]].eb(a[i]);rr tuple{a,b};} else{au[a,b,c]=ygi(g,m,f);fo(i,m)g[b[i]].eb(a[i],c[i]);rr tuple{a,b,c};}}I(J G)au ti(G&g,bo f=1){rr mgi(g,len(g)-1,f);} u1 en(cs str&s,cs str&b="a"){u1 r;fe(s,e)r.eb(len(b)==1?e-b[0]:b.find_first_of(e));rr r;}u1 sien(cs str&b="a"){RD(str,s);rr en(s,b);} u2 en(cs strs&s,cs str&b="a"){u2 r;fe(s,e)r.eb(en(e,b));rr r;}u2 sien(ll n,cs str&b="a"){strs s(n);li(s);rr en(s,b);} str de(cs u1&a,cs str&b="a"){str r;fe(a,e)r+=len(b)==1?e+b[0]:0<=e&&e(f)){}I(J...A)decltype(au)O()(A&&...a)cs{rr F::O()(*this,std::forward(a)...);}}; I(J...A)u1 zp(A&...a){u1 v=(a^...);uq(v);([&](u1&u){fe(u,e)e=arglb(v,e);}(a),...);rr v;}I(J...A)vo dec(A&...a){((--a),...);} I(J F,J...A)u1 vs(F f,A&...a){u1 o=io((len(a)&...));srt(o,cref(f));([&](au&e){au c=e;fo(i,len(e))e[i]=c[o[i]];}(a),...);rr o;} I(J F)dd bsd(F f,dd o,dd n){fo(l2(zz(o-n)/ee)+5)(f((o+n)/2)?o:n)=(o+n)/2;rr o;}ll sqr(ll x){ll r=sqrt(zz(x-ee));wh(r+1<=x/(r+1))++r;rr r;} I(J F)ll bsl(F f,ll o,ll n){wh(zz(o-n)>1)(f((o+n)/2)?o:n)=(o+n)/2;rr o;}u1 divs(ll n){u1 r;fo(i,1,sqr(n)+1)if(n%i==0)r.eb(i),r.eb(n/i);rr uq(r);} cls fact(ll n){umapm;fo(i,2,sqr(n)+1)wh(n%i==0)++m[i],n/=i;if(n>1)++m[n];cls r;fe(m,e)r.eb(e);rr srt(r);} cls rle(cs u1&a){cls r;fe(a,e)len(r)&&e==rb(r).a?++rb(r).b:r.eb(e,1).b;rr r;}cls rce(u1 a){rr rle(srt(a));} lll pow(lll x,ulll n,ulll m=0){lll r=1;wh(n)n&1?r*=x:r,x*=x,m?r%=m,x%=m:r,n>>=1;rr r;} vo main(){ll T=1;fo(T)solve();} vo solve(){ LL(N,M); U2(N,N,a); fo(i,N)fo(j,i+1,N)swap(a[i][j],a[j][i]); fo(i,N){ if(sum(a[i])!=M)done(-1); } fo(j,N){ ll su=0; fo(i,N)su+=a[i][j]; if(su!=M)done(-1); } u1 used(M); au res=vec({M,N}); fo(j,N){ fo(i,M){ fo(k,N){ if(a[k][j]&&!at(used[i],k)){ a[k][j]--; used[i]|=pw2(k); res[i][j]=k; break; } } } } pp(++res); }}