#include <bits/stdc++.h>
using namespace std;
int n, m, a[110][110], k;
bool bj[110][110];
inline int getint() {
  int w = 0, q = 0;
  char c = getchar();
  while ((c < '0' || c > '9') && c != '-') c = getchar();
  if (c == '-') q = 1, c = getchar();
  while (c >= '0' && c <= '9') w = w * 10 + c - '0', c = getchar();
  return q ? -w : w;
}
int main() {
  cin >> n >> k;
  if (k > n * n) {
    cout << -1;
    return 0;
  }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      if (!k) continue;
      if (bj[i][j]) continue;
      if (i == j) {
        k--;
        bj[i][j] = 1;
        a[i][j] = 1;
      } else {
        if (k == 1) continue;
        bj[i][j] = bj[j][i] = 1;
        a[i][j] = a[j][i] = 1;
        k -= 2;
      }
    }
  if (k) {
    cout << -1;
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) printf("%d ", a[i][j]);
    printf("\n");
  }
  return 0;
}
