#include <bits/stdc++.h>
using namespace std;
const int maxN = 100;
int a[maxN][maxN], n, k;
void Solve() {
  fill_n(&a[0][0], sizeof(a) / sizeof(a[0][0]), 0);
  for (int i = 0; i < n; i++)
    for (int j = i; j < n; j++) {
      if (i == j && k < 1) return;
      if (i < j && k < 2) {
        if (k == 0)
          return;
        else
          goto done;
      }
      if (i == j)
        a[i][i] = 1, k--;
      else
        a[i][j] = a[j][i] = 1, k -= 2;
    }
done:
  int i = 0;
  while (a[i][i] == 1) i++;
  a[i][i] = 1;
}
void Print() {
  for (int i = 0; i < n; i++, cout << '\n')
    for (int j = 0; j < n; j++) cout << a[i][j] << ' ';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> k;
  if (k > n * n)
    cout << -1;
  else {
    Solve();
    Print();
  }
}
