# Educational Codeforces Round 20 a Maximal Binary Matrix

A. Maximal Binary Matrix
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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
Copy
2 1

Output
Copy
1 0
0 0

Input
Copy
3 2

Output
Copy
1 0 0
0 1 0
0 0 0

Input
Copy
2 5

Output
Copy
-1


#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
int g[105][105];
int main()
{
int n,k;
cin>>n>>k;
int cnt=1;
if(k>n*n)
cout<<-1<<endl;
else
{
for(int i=0;i<n;i++)
{
for(int j=i;j<n;j++)
{
if(cnt>k)
{
break;
}
else
{
if(i==j)
{

g[i][j]=1;
cnt++;
}
else
{
// cout<<cnt<<endl;
if(cnt+1<=k)
{
g[i][j]=1;
g[j][i]=1;
cnt+=2;
}
else
{
g[i+1][i+1]=1;
cnt++;
}
}
}

}
}
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
cout<<g[i][j]<<' ';
}
cout<<endl;
}
}
return 0;
}


02-18 208

06-28 124

06-10 121

01-13 597

04-05 197

06-28 47

05-22 124

06-11 96

05-04 195

06-12 94