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
import java.io.*;
import java.util.StringTokenizer;

public class ProblemA {

    public static void solve(InputReader in, PrintWriter out) throws IOException{
        int n = in.nextInt();
        int k = in.nextInt();

        int[][] a = new int[n][n];
        int posI = 0, posJ = 0;
        boolean fail = false;
        for (int i=0; i<k; i++){
            if (posI == posJ){
                a[posI][posJ] = 1;
            } else {
                if (i+1 == k){
                    posJ++;
                    posI = posJ;
                    if (posJ == n){
                        fail = true;
                        break;
                    }

                    a[posI][posJ] = 1;
                    break;
                }

                a[posI][posJ] = 1;
                a[posJ][posI] = 1;
                i++;
            }

            posI++;
            if (posI == n){
                posJ++;
                posI = posJ;
                if (posJ == n){
                    if (i+1 != k){
                        fail = true;
                    }
                    break;
                }
            }
        }

        if (fail){
            out.println(-1);
        } else {
            for (int i=0; i<n; i++){
                for (int j=0; j<n; j++){
                    out.print(a[i][j] + " ");
                }
                out.println();
            }
        }
    }

    public static void main(String[] args) throws IOException{
        InputReader in;
        PrintWriter out;

        if (args.length > 0 && args[0].equals("file")) {
            in = new InputReader(new BufferedReader(new FileReader("input.txt")));
            out = new PrintWriter(new FileWriter("output.txt"));

            int sampleNumber = 1;
            do {
                out.println("Sample #" + sampleNumber++ + ": ");
                solve(in, out);
                out.println("");
            } while (in.reader.readLine() != null);
        } else {
            in = new InputReader(new BufferedReader(new InputStreamReader(System.in)));
            out = new PrintWriter(new OutputStreamWriter(System.out));
            solve(in, out);
        }

        in.reader.close();
        out.close();
    }

    public static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(BufferedReader reader) {
            this.reader = reader;
            tokenizer = null;
        }

        public String next() throws IOException{
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                tokenizer = new StringTokenizer(reader.readLine());
            }

            return tokenizer.nextToken();
        }

        public int nextInt() throws IOException{
            return Integer.parseInt(next());
        }
    }

}
