/*
[templates]: 
duipai
compre
addhis
floor_sum
matrix
network_flow
polynomial
lca
bitset
valuesgt
fenwick
erbitree
segment
mcmf
primal_dual
centroid
add0cnt
euler
basis
*/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#include<bits/stdc++.h>
using namespace std;
#define int long long
//use ll instead of int.
#define f(i, a, b) for(int i = (a); i <= (b); i++)
#define cl(i, n) i.clear(),i.resize(n);
#define endl '\n'
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e18;
//#define cerr if(false)cerr
//#define freopen if(false)freopen
mt19937 rng(std::chrono::high_resolution_clock::now().time_since_epoch().count()); 
int rnd(int l, int r) {return rng() % (r-l+1) + l; }
#define watch(x) cerr  << (#x) << ' '<<'i'<<'s'<<' ' << x << endl
void pofe(int number, int bitnum) {
    string s; f(i, 0, bitnum) {s += char(number & 1) + '0'; number >>= 1; } 
    reverse(s.begin(), s.end()); cerr << s << endl; 
    return;
}
double runtime() {return 1.0*clock()/CLOCKS_PER_SEC;}
template <typename TYP> void cmax(TYP &x, TYP y) {if(x < y) x = y;}
template <typename TYP> void cmin(TYP &x, TYP y) {if(x > y) x = y;}
//调不出来给我对拍！
//use std::array.
const int N=100; 
bool ok[N+10][N+10];int typ[N+10][N*N+10]; 
bool vec[N+10][N+10][N+10]; 
bool a[N+10][N+10]; 
bool mat[N+10][N+10], bas[N+10][N+10]; 
bool ch[N+10][N+10]; int ind[N+10]; int cnt; int didnt[N+10]; 
bool tmp[N+10]; bool dp[N+10][N*N+10]; bool res[N+10][N+10]; 
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    // freopen("QOJ6650.in","r",stdin);
    // freopen("QOJ6650.out","w",stdout);
    // freopen("QOJ6650.ear","w",stderr);
    //time_t start = clock();
    //think twice,code once.
    //think once,debug forever.
    int n,k;cin>>n>>k;
    f(i,1,n)f(j,1,n)cin>>a[i][j];
    dp[0][0]=1; 
    f(lie,1,n) {
        f(i,1,n) f(j,1,n) mat[j][i]=a[i][j]; 
        f(i,1,n) mat[i][i] ^= a[i][lie];
        memset(bas,0,sizeof bas); 
        memset(ch,0,sizeof ch); 
        memset(ind,0,sizeof ind); cnt=0; 
        // cerr<<"lie="<<lie<<endl;
        // f(i,1,n)f(j,1,n)cerr<<mat[i][j]<<" \n"[j==n]; 
        f(i,1,n) {
            ch[i][i]=1; bool suc=0;
            for(int j=n;j>=1;j--) {
                if(mat[i][j]) {
                    if(bas[j][j]) {
                        f(k,1,n) mat[i][k] ^= bas[j][k]; 
                        f(k,1,n) ch[i][k] ^= ch[ind[j]][k]; 
                    }
                    else {
                        f(k,1,n) bas[j][k]=mat[i][k]; 
                        ind[j]=i; suc=1; 
                        break; 
                    }
                }
            }
            // cerr<<"row "<< i<<", insertion correctness: "<<suc<<endl;
            // cerr<<"ch["<<i<<"][]: ";f(j,1,n)cerr<<ch[i][j]<<" \n"[j==n];
            if(!suc) {
                didnt[++cnt]=i; 
            }
        } 
        f(i,0,(1<<cnt)-1) {
            memset(tmp,0,sizeof tmp); 
            f(j,1,cnt) if((i>>(j-1))&1) {
                f(k,1,n)tmp[k]^=ch[didnt[j]][k]; 
            }
            int tot=0; f(j,1,n)tot+=tmp[j]; 
            // cerr<<"found a Zero, size = "<<tot<<endl;
            ok[lie][tot]=1; f(j,1,n)vec[lie][tot][j] = tmp[j]; 
        }
        f(i,0,n)dp[lie][i]=dp[lie-1][i]; 
        f(i,0,n) if(ok[lie][i]) for(int j=n*n;j>=i;j--){
            if(dp[lie-1][j-i]) {typ[lie][j]=i; dp[lie][j]=1;}
        }  
        // cerr<<"dp["<<lie<<"]: "; f(j,0,n*n)cerr<<dp[lie][j]<<" \n"[j==n*n]; 
    }
    if(dp[n][k]!=1) {cout<<-1<<endl;return 0; }
    else {
        cout<<1<<endl;
        int ni=n,nj=k;
        while(ni != 0) {
            // cerr<<"path: " <<ni<<" "<<nj<<", typ="<<typ[ni][nj]<<endl;
            if(typ[ni][nj]) {
                f(i,1,n)res[i][ni]=vec[ni][typ[ni][nj]][i]; 
                nj-=typ[ni][nj]; ni--;
            }
            else ni--; 
        } 
        f(i,1,n)f(j,1,n)cout<<res[i][j]<<" \n"[j==n];
    }
    //time_t finish = clock();
    //cout << "time used:" << (finish-start) * 1.0 / CLOCKS_PER_SEC <<"s"<< endl;
    return 0;
}