CF803A.Maximal Binary Matrix

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.

给你一个 $n$ 行 $n$ 列的矩阵，初始时所有元素均为 $0$。你需要在其中放置 $k$ 个 $1$，使得最终得到的矩阵关于主对角线（即从左上角到右下角的对角线）对称，且字典序最大。

若矩阵 $A$ 的字典序大于矩阵 $B$，则定义为：从上到下逐行比较两个矩阵，在第一个存在差异的行中，第一个不同的数在 $A$ 中大于 $B$ 中对应位置的数。

如果不存在满足条件的矩阵，则输出 $-1$。

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

第一行包含两个数字 $n$ 和 $k$（$1 ≤ n ≤ 100$，$0 ≤ k ≤ 10^6$）。

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

如果答案存在，则输出结果矩阵；否则输出 $-1$。