#include <bits/stdc++.h>
using namespace std;
const long long int inf = 2e5 + 5;
const long long int MOD = 1e9 + 7;
const int MAX = 2e5 + 2;
using namespace std;
void solve() {
  int n, k;
  cin >> n >> k;
  int a[n][n];
  memset(a, 0, sizeof(a));
  int rem = k;
  for (int i = 0; i < n and k > 0; ++i) {
    for (int j = 0; j < n and k > 0; ++j) {
      if (a[i][j]) continue;
      if (i == j) {
        if (rem >= 1) {
          a[i][j] = 1;
          rem--;
        }
      } else {
        if (rem >= 2) {
          a[i][j] = a[j][i] = 1;
          rem -= 2;
        }
      }
    }
  }
  if (rem) {
    for (int i = 0; i < n; ++i) {
      if (!a[i][i]) {
        a[i][i] = 1;
        rem--;
      }
    }
  }
  if (rem) {
    cout << -1 << endl;
    return;
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      cout << a[i][j] << " ";
    }
    cout << endl;
  }
}
int main() {
  solve();
  return 0;
}
