#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <cstring>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <random>
#include <ctime>
#include <chrono>
#include <iomanip>
#include <cassert>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 110, MAXM = 1e4 + 10;

int n, K, ans[MAXN];

bool a[MAXN][MAXN], f[MAXN][MAXN];
bool res[MAXN][MAXN][MAXN];
bool b[MAXN];

inline int Gauss()
{
    for (int i = 1; i <= n; i++)
    {
        int p = i; while (p <= n && !f[p][i]) p++;
        if (p > n) return i - 1;
        if (p != i) swap(f[i], f[p]);
        for (int j = 1; j <= n; j++)
            if (i != j && f[j][i])
                for (int k = i; k <= n + 1; k++)
                    f[j][k] ^= f[i][k];
    }
    return n;
}

bool g[MAXN][MAXN];
bool dp[MAXN][MAXM];
int pre[MAXN][MAXM];

mt19937 Rand(chrono::steady_clock::now().time_since_epoch().count());

int main()
{
    // freopen(".in", "r", stdin);
    // freopen(".out", "w", stdout);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n), Read(K);
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
        {
            Read(a[i][j]);
            // a[i][j] = Rand() & 1;
        }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
            for (int k = 1; k <= n; k++)
                f[j][k] = a[j][k];
        for (int j = 1; j <= n; j++) f[j][n + 1] = a[j][i];
        int t = Gauss();
        for (int s = 0; s < (1 << (n - t)); s++)
        {
            for (int j = 1; j <= t; j++) b[j] = f[j][n + 1];
            for (int j = t + 1; j <= n; j++) b[j] = s >> (j - t - 1) & 1;
            for (int j = t + 1; j <= n; j++)
                if (s >> (j - t - 1) & 1)
                    for (int k = 1; k <= t; k++)
                        b[k] ^= f[k][j];
            int cnt = 0;
            for (int j = 1; j <= n; j++) cnt += b[j];
            g[i][cnt] = 1;
            for (int j = 1; j <= n; j++) res[i][cnt][j] = b[j];
        }
    }
    dp[0][0] = 1;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 0; j <= i * n; j++)
        {
            if (dp[i - 1][j]) { dp[i][j] = 1, pre[i][j] = 0; continue; }
            for (int k = 0; k <= n && k <= j; k++)
                if (g[i][k] && dp[i - 1][j - k]) { dp[i][j] = 1, pre[i][j] = k; break; }
        }
    }
    if (!dp[n][K]) return cout << "-1\n", 0;
    int x = K;
    for (int i = n; i >= 1; i--) ans[i] = pre[i][x], x -= pre[i][x];
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            a[j][i] = res[i][ans[i]][j];
    // for (int i = 1; i <= n; i++) cout << ans[i] << ' '; cout << '\n';
    for (int i = 1; i <= n; i++, cout << '\n')
        for (int j = 1; j <= n; j++)
            cout << a[i][j] << " ";
    return 0;
}