#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const double EPS = numeric_limits<double>::epsilon();
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const int MOD = (int)1e9 + 7;
int main() {
  int n, k;
  scanf("%d", &n), scanf("%d", &k);
  if (k > n * n) {
    puts("-1");
    return 0;
  }
  vector<vector<int> > a(n, vector<int>(n, 0));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (i != j) {
        if (k >= 2) {
          if (a[i][j] != 1 && a[j][i] != 1) {
            a[i][j] = 1;
            a[j][i] = 1;
            k -= 2;
          }
        }
      } else {
        if (k >= 1) {
          if (a[i][j] != 1) {
            a[i][j] = 1;
            k--;
          }
        }
      }
    }
  }
  if (k != 0) {
    puts("-1");
    return 0;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      printf("%d ", a[i][j]);
    }
    printf("\n");
  }
  return 0;
}
