Maximal Binary Matrix

给你一个 $n$ 行 $n$ 列全是 $0$ 的矩阵。 你需要把$ k$ 个$ 1 $ 放到矩阵中，保证这个矩阵按照左上向右下的对称轴对称，并且保证这个矩阵的字典序最大。 两个矩阵比较字典序时从第一行向最后一行，每一行从前向后进行比较。 如果不存在这样一个矩阵输出 `-1`。

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.

The first line consists of two numbers $ n $ and $ k $ ( $ 1<=n<=100 $ , $ 0<=k<=10^{6} $ ).

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

2 1

1 0 
0 0 

3 2

1 0 0 
0 1 0 
0 0 0 

2 5

-1