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 JAVA):

Solution:
import java.util.Arrays;
import java.util.Scanner;


public class Main {
	public static void main(String[] argv)
	{
		Main m = new Main();
		m.solve();
		
	}
	public void solve () {
		Scanner scanner = new Scanner(System.in);
		
	
		int n = scanner.nextInt();
		int a = scanner.nextInt();
		if (a > n * n) {
			System.out.println(-1);
			return ;
		}
		int A[][] = new int[n][n];
		for (int i = 0; i < n; i++)
			for (int j = 0; j < n; j++) {
				
				if (a == 0) break;
				else if (A[i][j] == 1) continue;
				else if (i == j) {
					A[i][j] = 1;
					a--;
				}
				else if( a > 1) {
					A[i][j] = 1;
					A[j][i] = 1;
					a -=2;
				}
				
			}
		  
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++)
				System.out.print(A[i][j] + " ");
			System.out.println();
		}
//		while (i < n) {
//			if (i == 0) ;
//			else a = i;
//			
//			for (int j = a; j <= z[cnt_t]; j++, i++)
//				res[j] = z[cnt_t] - j;
//			
//			int b = 0;
//			if (cnt_t == cnt) {
//				b = n;
//			}
//			else b = (z[cnt_t + 1] - z[cnt_t]) / 2;
//			
//			for (int j = z[cnt_t] + 1; j < b; j++, i++) {
//				res[j] = j - z[cnt_t];
//			}
//			cnt_t++;
//		}
		
		
		
		
		
		
		

	}

}