A - Maximal Binary Matrix CodeForces - 803A

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 ≤ 10⁶).

Output

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

Example

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

题意：给你个n*n的矩阵，和k个1，问怎样得到一个最大的对称矩阵，从上到下从左到右都最大，就是有1的比是0的大，，，

0 1 1 0

1 0 比 0 1 要小因为第一行前者是0 后者是1，

所以就要从上三角开始填1，而且对称着填

#include <bits/stdc++.h>  
  
using namespace std;  
int n,k;  
int a[105][105];  
int main()  
{  
    while(~scanf("%d%d",&n,&k)){  
        if (k > n*n) {  
            printf("-1\n");  
            continue;  
        }  
        for (int i=0; i<n; i++){  
            for (int j=i; j<n; j++){  
                if (k==0) break;  
                if (i==j){  
                    a[i][j]=1;  
                    k--;  
                }  
                else {  
                    if (k==1) continue;  //说明必须要剩下的这个1 填在对角线上.
                    a[i][j]=a[j][i]=1;  
                    k-=2;  
                }  
            }  
            if (k==0) break;  
        }  
        for (int i=0; i<n; i++){  
            for (int j=0; j<n-1; j++)  
                printf("%d ",a[i][j]);  
            printf("%d\n",a[i][n-1]);  
        }  
    }  
    return 0;  
}