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.io.*;
    	    import java.math.*;
    	    import java.util.*;
    	    import javax.print.attribute.SetOfIntegerSyntax;
    	     
    	    public class Main {
    	    	private static InputStream stream;
    	    	private static byte[] buf = new byte[1024];
    	    	private static int curChar;
    	    	private static int numChars;
    	    	private static SpaceCharFilter filter;
    	    	private static PrintWriter pw;
    	    	private static long count = 0,mod=1000000007;
    	    	private static TreeSet<Integer>ts[]=new TreeSet[200000];
    	    	private static HashSet hs=new HashSet();
    	     
     
    	    	 public static void main(String[] args) {
    		        	InputReader(System.in);
    		    		pw = new PrintWriter(System.out); 
    		            new Thread(null ,new Runnable(){
    		               public void run(){
    		                   try{
    		                       soln();
    		                       pw.close();
    		                   } catch(Exception e){
    		                       e.printStackTrace();
    		                   }
    		               }
    		           },"1",1<<26).start();
    		       }
    	     
    	     
    	    	public static long gcd(long x, long y) {
    	    		if (x == 0)
    	    			return y;
    	    		else
    	    			return gcd( y % x,x);
    	    	}
    	    	
    	    	 
    	    	// To Get Input
    	    	// Some Buffer Methods
    	     
    	    	public static void InputReader(InputStream stream1) {
    	    		stream = stream1;
    	    	}
    	     
    	    	private static boolean isWhitespace(int c) {
    	    		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    	    	}
    	     
    	    	private static boolean isEndOfLine(int c) {
    	    		return c == '\n' || c == '\r' || c == -1;
    	    	}
    	     
    	    	private static int read() {
    	    		if (numChars == -1)
    	    			throw new InputMismatchException();
    	    		if (curChar >= numChars) {
    	    			curChar = 0;
    	    			try {
    	    				numChars = stream.read(buf);
    	    			} catch (IOException e) {
    	    				throw new InputMismatchException();
    	    			}
    	    			if (numChars <= 0)
    	    				return -1;
    	    		}
    	    		return buf[curChar++];
    	    	}
    	     
    	    	private static int nextInt() {
    	    		int c = read();
    	    		while (isSpaceChar(c))
    	    			c = read();
    	    		int sgn = 1;
    	    		if (c == '-') {
    	    			sgn = -1;
    	    			c = read();
    	    		}
    	    		int res = 0;
    	    		do {
    	    			if (c < '0' || c > '9')
    	    				throw new InputMismatchException();
    	    			res *= 10;
    	    			res += c - '0';
    	    			c = read();
    	    		} while (!isSpaceChar(c));
    	    		return res * sgn;
    	    	}
    	     
    	    	private static long nextLong() {
    	    		int c = read();
    	    		while (isSpaceChar(c))
    	    			c = read();
    	    		int sgn = 1;
    	    		if (c == '-') {
    	    			sgn = -1;
    	    			c = read();
    	    		}
    	    		long res = 0;
    	    		do {
    	    			if (c < '0' || c > '9')
    	    				throw new InputMismatchException();
    	    			res *= 10;
    	    			res += c - '0';
    	    			c = read();
    	    		} while (!isSpaceChar(c));
    	    		return res * sgn;
    	    	}
    	     
    	    	private static String nextToken() {
    	    		int c = read();
    	    		while (isSpaceChar(c))
    	    			c = read();
    	    		StringBuilder res = new StringBuilder();
    	    		do {
    	    			res.appendCodePoint(c);
    	    			c = read();
    	    		} while (!isSpaceChar(c));
    	    		return res.toString();
    	    	}
    	     
    	    	private static String nextLine() {
    	    		int c = read();
    	    		while (isSpaceChar(c))
    	    			c = read();
    	    		StringBuilder res = new StringBuilder();
    	    		do {
    	    			res.appendCodePoint(c);
    	    			c = read();
    	    		} while (!isEndOfLine(c));
    	    		return res.toString();
    	    	}
    	     
    	    	private static int[] nextIntArray(int n) {
    	    		int[] arr = new int[n];
    	    		for (int i = 0; i < n; i++) {
    	    			arr[i] = nextInt();
    	    		}
    	    		return arr;
    	    	}
    	     
    	    	private static int[][] next2dArray(int n, int m) {
    	    		int[][] arr = new int[n][m];
    	    		for (int i = 0; i < n; i++) {
    	    			for (int j = 0; j < m; j++) {
    	    				arr[i][j] = nextInt();
    	    			}
    	    		}
    	    		return arr;
    	    	}
    	    	private static char[][] nextCharArray(int n,int m){
    	    		char [][]c=new char[n][m];
    	    		for(int i=0;i<n;i++){
    	    			String s=nextLine();
    	    			for(int j=0;j<s.length();j++){
    	    				c[i][j]=s.charAt(j);
    	    			}
    	    		}
    	    		return c;
    	    	}
    	     
    	    	private static long[] nextLongArray(int n) {
    	    		long[] arr = new long[n];
    	    		for (int i = 0; i < n; i++) {
    	    			arr[i] = nextLong();
    	    		}
    	    		return arr;
    	    	}
    	     
    	    	private static void pArray(int[] arr) {
    	    		for (int i = 0; i < arr.length; i++) {
    	    			pw.print(arr[i] + " ");
    	    		}
    	    		pw.println();
    	    		return;
    	    	}
    	     
    	    	private static void pArray(long[] arr) {
    	    		for (int i = 0; i < arr.length; i++) {
    	    			pw.print(arr[i] + " ");
    	    		}
    	    		pw.println();
    	    		return;
    	    	}
    	     
    	    	private static void pArray(boolean[] arr) {
    	    		for (int i = 0; i < arr.length; i++) {
    	    			pw.print(arr[i] + " ");
    	    		}
    	    		pw.println();
    	    		return;
    	    	}
    	     
    	    	private static boolean isSpaceChar(int c) {
    	    		if (filter != null)
    	    			return filter.isSpaceChar(c);
    	    		return isWhitespace(c);
    	    	}
    	     
    	    	private interface SpaceCharFilter {
    	    		public boolean isSpaceChar(int ch);
    	    	}
    	     
    	    	//----------------------------------------My Code------------------------------------------------//
    	
     
    	    	
    	    	private static void soln() {
    	    	    int n=nextInt();
    	    	    int k=nextInt();
    	    	    int[][] arr=new int[n][n];
    	    	    if(k>(n*n)){
    	    	    	pw.println("-1");
    	    	    	return;
    	    	    }
    	    	    
    	    	    
    	    	   for(int i=0;i<n;i++){
    	    		   for(int j=i;j<n;j++){
    	    			   
    	    			   if((k-2)>=0){
    	    				   if(i!=j){
    	    					   arr[i][j]=arr[j][i]=1;
    	    					   k-=2;
    	    				   }
    	    				   else {
    	    					   arr[i][i]=1;
    	    					   k--;
    	    				   }
    	    			   }
    	    			   else if(k==1){
    	    				   if(i==j){
    	    					   arr[i][i]=1;
    	    				   }
    	    				   else{
    	    					   arr[i+1][i+1]=1;
    	    				   }
    	    				   k--;
    	    			   }
    	    		   }
    	    		   if(k==0){
    	    			   break;
    	    		   }
    	    	   }
    	    	    
    	    	    
    	    	    for(int i=0;i<n;i++){
    	    	    	for(int j=0;j<n;j++){
    	    	    		pw.print(arr[i][j]+" ");
    	    	    	}
    	    	    	pw.println();
    	    	    	
    	    	    }
    	    	 
    	    	}
    	    		//-----------------------------------------The End--------------------------------------------------------------------------//
    	    
    	    
    	    	
    	    	
    	 }
    	    	
    	   
    	    
    		class Pair implements Comparable<Pair>{
    		     
    			int x;
    			int y;
    			Pair(int idx,int val){
    				this.x=idx;
    				this.y=val;
    			}
    			@Override
    			public int compareTo(Pair o) {
    				// TODO Auto-generated method stub
    			//	Sort in increasing order
    					if(y>o.y){
    						return -1;
    					}
    					else if(y==o.y){
    						return 0;
    					}
    					else return 1;
                           
    				
    			}
    		
    		}