//
// Created by Luhao Yan on 2023/11/26.
//
#include <bits/stdc++.h>

const int maxn = 102;
int n,k,a[maxn][maxn];
std::vector<int>ok[maxn];
std::map<int,std::vector<int> > way[maxn];
int pre[maxn][maxn*maxn],ans[maxn][maxn];

int solve(int j) {
    std::bitset<102>b[102],m[102];
    int row = 0;
    for (int i = 1; i <= n; ++ i) {
        ++ row;
        b[row][i] = b[row][i] ^ a[i][j];
        for (int k = 1; k <= n; ++ k)
            b[row][k] = b[row][k] ^ a[i][k];
    }
    int rank = 0;
    for (int i = 1; i <= n; ++ i) {
        for (int j = 1; j <= n; ++ j) {
            if (!b[i][j]) continue;
            if (m[j][j]) b[i] ^= m[j];
            else {
                m[j] = b[i];
                rank ++;
                break;
            }
        }
    } for (int i = 1; i <= n; ++ i) {
        if (!m[i][i]) continue;
        for (int j = 1; j < i; ++ j)
            if (m[j][i]) m[j] ^= m[i];
    }
    std::vector<int>free;
    for (int i = n; i >= 1; i --)
        if (!m[i][i]) free.push_back(i);
    assert(free.size() == n - rank);
    int f = n - rank;
    std::vector<int>w(n + 2);
    ok[j].push_back(0);
    way[j][0] = w;
    for (int S = 0; S < (1 << f); ++ S) {
        for (int i = 0; i < f; ++ i) w[free[i]] = ((S >> i) & 1);
        for (int i = n; i >= 1; i --) {
            if (!m[i][i]) continue;
            w[i] = 0;
            for (int j = i + 1; j <= n; ++ j) if (m[i][j]) w[i] ^= w[j];
        }
        int sum = std::accumulate(w.begin(),w.end(),0);
        way[j][sum] = w;
        ok[j].push_back(sum);
    }
//    printf("%d : \n",j);
//    for (int x : ok[j]) printf("%d ",x); puts("");
    return n - rank;
}

int main() {
    scanf("%d%d",&n,&k);
    for (int i = 1; i <= n; ++ i)
        for (int j = 1; j <= n; ++ j) {
            scanf("%d", &a[i][j]);
         //   a[i][j] = rand() % 2;
        }
    for (int j = 1; j <= n; ++ j) solve(j);
    memset(pre,-1,sizeof(pre));
    pre[1][0] = 0;
    for (int i = 1; i <= n; ++ i) {
        for (int j = 0; j <= n * n; ++ j) {
            if (-1 == pre[i][j]) continue;
            for (int x:ok[i]) pre[i + 1][j + x] = x;
        }
    }
    if (pre[n + 1][k] == -1) { puts("-1"); return 0; }
    int k1 = k;
    for (int i = n; i >= 1; i --) {
        int x = pre[i + 1][k1];
        std::vector<int>res = way[i][x];
        for (int j = 1; j <= n; ++ j) ans[j][i] = res[j];
        k1 -= x;
    }
//    for (int i = 1; i <= n; ++ i) {
//        for (int j = 1; j <= n; ++ j) {
//            printf("%d",a[i][j]);
//            if (j < n) putchar(' ');
//        } puts("");
//    } puts("---");
    assert(k1 == 0);
    puts("1");
    for (int i = 1; i <= n; ++ i) {
        for (int j = 1; j <= n; ++ j) {
            printf("%d",ans[i][j]);
            if (j < n) putchar(' ');
        } puts("");
    }
    int sm = 0;
    for (int i = 1; i <= n; ++ i) {
        for (int j = 1; j <= n; ++ j) {
            sm += ans[i][j];
            int t1 = (a[i][j] * ans[i][j]);
            int t2 = 0;
            for (int k = 1; k <= n; ++ k)
                t2 ^= (a[i][k] * ans[k][j]);
       //     if (t1 != t2) { printf("<%d %d>\n",i,j); }
            assert(t1 == t2);
        }
    } assert(sm == k);
    return 0;
}