#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef local
#include <experimental/iterator>
#define safe cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(const char *s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(const char *s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

const int maxn = 100;
using BS = bitset<maxn>;


BS A[maxn];

BS M[maxn];
BS B[maxn];

int main() {
  cin.tie(nullptr) -> sync_with_stdio(false);

  int n;
  cin >> n;
  int need;
  cin >> need;

  mt19937 rng(114514);

  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      int x;
      cin >> x;
      A[i][j] = x;
      // A[i][j] = rng() & 1;
    }
  }

  vector<vector<BS>> orth(n);
  vector<vector<int>> mask(n, vector<int>(n + 1, -1));

  vector<vector<int>> dp(n + 1, vector<int>(n * n + 1, -1));
  dp[0][0] = 0;

  for (int j = 0; j < n; j++) {
    for (int i = 0; i < n; i++)
      M[i].reset();

    int rnk = 0;
    auto Insert = [&](BS b) {
      for (int i = n - 1; i >= 0; i--) if (b[i]) {
        if (M[i][i]) {
          b ^= M[i];
        } else {
          M[i] = b;
          ++rnk;
          return;
        }
      }
    };

    for (int i = 0; i < n; i++) {
      BS b = A[i];
      if (A[i][j]) {
        b[i] = !b[i];
      }
      Insert(b);
    }

    debug(rnk);
    /* for (int i = 0; i < n; i++) */
    /*   debug(M[i]); */
    for (int i = n - 1; i >= 0; i--) if (M[i][i]) {
      for (int k = i + 1; k < n; k++) if (M[k][i]) {
        M[k] ^= M[i];
      }
    }
    /* for (int i = 0; i < n; i++) */
    /*   debug(M[i]); */

    for (int k = 0; k < n; k++) {
      if (!M[k][k]) {
        orth[j].emplace_back();
        orth[j].back()[k] = true;
        for (int i = 0; i < n; i++)
          if (M[i][k])
            orth[j].back()[i] = true;
      }
    }

    for (int i = 0; i < n; i++)
      if (M[i].any())
        assert(M[i][i]);

    for (const auto &o : orth[j]) {
      for (int i = 0; i < n; i++) {
        int s = 0;
        s = (M[i] & o).count() & 1;
        /* for (int k = 0; k < n; k++) { */
        /*   s ^= M[i][k] & o[k]; */
        /* } */
        debug(s, M[i], o);
        assert(s == 0);
      }
    }

    debug(orth[j].size());
    debug(rnk);

    for (int s = 0; s < 1 << orth[j].size(); s++) {
      BS b;
      for (size_t i = 0; i < orth[j].size(); i++)
        if (s >> i & 1)
          b ^= orth[j][i];
      mask[j][b.count()] = s;
    }

    for (int k = 0; k <= n; k++) if (mask[j][k] != -1) {
      for (int i = 0; i <= n * n; i++) if (dp[j][i] != -1) {
        if (i + k <= n * n) {
          dp[j + 1][i + k] = k;
        }
      }
    }
    orange(all(mask[j]));
  }


  orange(all(dp[n]));
  if (dp[n][need] == -1) {
    cout << -1 << '\n';
    return 0;
  }

  debug(need);
  safe;
  int k = need;
  for (int j = n - 1; j >= 0; j--) {
    int x = dp[j + 1][k];
    assert(x != -1);
    auto s = mask[j][x];
    k -= x;
    debug(j, k, s);
    if (x) assert(s);

    BS b;
    for (size_t i = 0; i < orth[j].size(); i++)
      if (s >> i & 1)
        b ^= orth[j][i];

    assert(b.count() == x);

    for (int i = 0; i < n; i++)
      B[i][j] = b[i];
  }

  cout << 1 << '\n';
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      cout << B[i][j] << (j+1==n ? '\n' : ' ');


  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) {
      int s = 0;
      for (int z = 0; z < n; z++)
        s ^= A[i][z] & B[z][j];
      assert(s == (A[i][j] & B[i][j]));
    }


}