Problem: You are given matrix with n rows and n columns filled with zeroes. You should put k ones in it in such a way that the resulting matrix is symmetrical with respect to the main diagonal (the diagonal that goes from the top left to the bottom right corner) and is lexicographically maximal.

One matrix is lexicographically greater than the other if the first different number in the first different row from the top in the first matrix is greater than the corresponding number in the second one.

If there exists no such matrix then output -1.

Input

The first line consists of two numbers n and k (1 ≤ n ≤ 100, 0 ≤ k ≤ 106).

Output

If the answer exists then output resulting matrix. Otherwise output -1.

Examples

Input

2 1


Output

1 0 
0 0 


Input

3 2


Output

1 0 0 
0 1 0 
0 0 0 


Input

2 5


Output

-1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
template <class T>
using V = vector<T>;
const ll MOD = 1e9 + 7;
const int MX = 2e+5;
const ll INF = 1e18;
const db PI = acos((db)-1);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
constexpr int pct(int x) { return __builtin_popcount(x); }
constexpr int bits(int x) { return x == 0 ? 0 : 31 - __builtin_clz(x); }
constexpr int p2(int x) { return 1 << x; }
constexpr int msk2(int x) { return p2(x) - 1; }
void setIO() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
}
int main() {
  setIO();
  int n, k;
  cin >> n >> k;
  if (k > n * n) {
    cout << -1 << '\n';
    return 0;
  }
  V<vi> res(n, vi(n));
  auto flush = [&]() {
    for (auto r : res) {
      for (int i : r) cout << i << ' ';
      cout << '\n';
    }
  };
  if (k == 0) {
    flush();
    return 0;
  }
  int cnt = 0;
  for (int i = (0); i < (n); ++i) {
    for (int j = (0); j < (n); ++j) {
      if (i == j) {
        res[i][j]++;
        cnt++;
      } else if (res[i][j] == 0 && cnt < k - 1) {
        res[i][j]++;
        res[j][i]++;
        cnt += 2;
      }
      if (cnt == k) {
        flush();
        return 0;
      }
    }
  }
  return 0;
}