#include <bits/stdc++.h>
#define sz(x) ((int)(x).size())
#define all(x) begin(x), end(x)
#ifdef memset0
#define log(...) fprintf(stderr, __VA_ARGS__)
#else
#define endl '\n'
#define log(...) (void(0))
#endif
using namespace std;
using ll = long long;
using lf = long double;
using ull = unsigned long long;
using lll = __int128;
const int N = 110;
int n, K, a[N][N], ps[N][N];
vector<int> ar[N];
lll t[N], b[N], w[N][N];
int cnt[N], fl[N], sz;
vector<int> ap[N];
lll nw;
int vl[N];
int f[N][N * N], wy[N][N * N], ans[N][N];
void prt(lll x) {
  for (int i = 1; i <= n; ++i) log("%d", (int)((x >> i) & 1));
  log("\n");
}
void Ins(lll x) {
  // log("Ins ");
  // prt(x);
  for (int i = 1; i <= n; ++i) {
    if ((x >> i) & 1) {
      if (!b[i]) {
        b[i] = x;
        for (int j = i + 1; j <= n; ++j)
          if ((b[i] >> j) & 1) {
            b[i] ^= b[j];
          }
        for (int j = 1; j < i; ++j)
          if ((b[j] >> i) & 1) {
            b[j] ^= b[i];
          }
        return;
      }
      x ^= b[i];
    }
  }
}
#define Appl(id, av) (nw ^= ((lll)1 << id), sz += av)
void Add(int x, int v) {
  fl[x] = v;
  if (v) Appl(x, 1);
  for (int i : ap[x]) {
    --cnt[i];
    vl[i] ^= v;
    if (cnt[i] == 1) {
      fl[i] = vl[i];
      if (vl[i]) Appl(i, 1);
    }
  }
}
void Res(int x, int v) {
  for (int i : ap[x]) {
    if (cnt[i] == 1) {
      if (vl[i]) Appl(i, -1);
      fl[i] = -1;
    }
    vl[i] ^= v;
    ++cnt[i];
  }
  if (v) Appl(x, -1);
  fl[x] = -1;
}
void dfs(int x, int pos) {
  // log("Dfs %d\n", x);
  if (!x) {
    if (ps[pos][sz]) return;
    // log("find sz=%d wy=", sz);
    // prt(nw);
    ps[pos][sz] = 1;
    ar[pos].push_back(sz);
    w[pos][sz] = nw;
    return;
  }
  if (fl[x] != -1) dfs(x - 1, pos);
  else {
    Add(x, 0);
    dfs(x - 1, pos);
    Res(x, 0);
    Add(x, 1);
    dfs(x - 1, pos);
    Res(x, 1);
  }
}
void Solve(int x) {
  // log("Solve %d:\n", x);
  // for (int i = 1; i <= n; ++i) {
  //   prt(b[i]);
  // }
  for (int i = 1; i <= n; ++i) {
    vector<int>().swap(ap[i]);
    cnt[i] = 0;
    fl[i] = -1;
  }
  nw = sz = 0;
  for (int i = 1; i <= n; ++i)
    if (b[i]) {
      for (int j = 1; j <= n; ++j)
        if ((b[i] >> j) & 1) {
          ap[j].push_back(i);
          ++cnt[i];
        }
      if (cnt[i] == 1) {
        fl[i] = 0;
        // log("Fixed %d\n", i);
      }
    }
  // log("?\n");
  dfs(n, x);
}
void Check() {
  int tmp;
  int cnt = 0;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) cnt += ans[i][j];
  assert(cnt == K);
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      tmp = 0;
      for (int k = 1; k <= n; ++k) tmp ^= a[i][k] * ans[k][j];
      if (tmp != a[i][j] * ans[i][j]) {
        log("Err(%d,%d)\n", i, j);
        assert(0);
      }
    }
  }
}
int main() {
#ifdef memset0
  freopen("F.in", "r", stdin);
#endif
  // cin.tie(0)->sync_with_stdio(0);
  cin >> n >> K;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) {
      cin >> a[i][j];
      if (a[i][j]) t[i] |= ((lll)1 << j);
    }
  for (int j = 1; j <= n; ++j) {
    // log("------------------j=%d\n", j);
    for (int i = 1; i <= n; ++i) b[i] = 0;
    for (int i = 1; i <= n; ++i) {
      if (!a[i][j]) Ins(t[i]);
      else
        Ins(t[i] ^ ((lll)1 << i));
    }
    Solve(j);
  }
  f[0][0] = 1;
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j <= n * (i - 1); ++j)
      if (f[i - 1][j]) {
        for (int s : ar[i]) {
          if (!f[i][j + s]) {
            f[i][j + s] = 1;
            wy[i][j + s] = s;
          }
        }
      }
  }
  if (f[n][K]) {
    for (int i = n, s, k = K; i >= 1; --i, k -= s) {
      s = wy[i][k];
      for (int j = 1; j <= n; ++j) ans[j][i] = ((w[i][s] >> j) & 1);
    }
    for (int i = 1; i <= n; ++i) {
      for (int j = 1; j <= n; ++j) {
        cout << ans[i][j] << " \n"[j == n];
      }
    }
    Check();
  } else
    cout << "-1\n";
}