#include <bits/stdc++.h>
using namespace std;
const long long N = 110;
long long n, k;
long long a[N][N];
void fill(long long i, long long len, long long rest) {
  if (len <= 0 || rest <= 0) return;
  long long tf = min((rest & 1 ? rest : rest - 1), (len * 2 - 1));
  for (long long j = i; j <= i + (tf + 1) / 2 - 1; j++) a[i][j] = 1;
  for (long long j = i; j <= i + (tf + 1) / 2 - 1; j++) a[j][i] = 1;
  fill(i + 1, len - 1, rest - tf);
}
signed main() {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n >> k;
  if (k > n * n) {
    cout << -1 << '\n';
    return 0;
  }
  fill(1, n, k);
  for (long long i = 1; i <= n; i++) {
    for (long long j = 1; j <= n; j++) cout << a[i][j] << ' ';
    cout << '\n';
  }
}
