We have a square grid with H rows and W columns. Snuke wants to write 0 or 1 in each of the squares. Here, all of the following conditions have to be satisfied:

* For every row, the smaller of the following is A: the number of 0s contained in the row, and the number of 1s contained in the row. (If these two numbers are equal, “the smaller” should be read as “either”.)
* For every column, the smaller of the following is B: the number of 0s contained in the column, and the number of 1s contained in the column.



Determine if these conditions can be satisfied by writing 0 or 1 in each of the squares. If the answer is yes, show one way to fill the squares so that the conditions are satisfied.

Constraints

* 1 \leq H,W \leq 1000
* 0 \leq A
* 2 \times A \leq W
* 0 \leq B
* 2 \times B \leq H
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


H W A B


Output

If the conditions cannot be satisfied by writing 0 or 1 in each of the squares, print -1.

If the conditions can be satisfied, print one way to fill the squares so that the conditions are satisfied, in the following format:


s_{11}s_{12}\cdots s_{1W}
s_{21}s_{22}\cdots s_{2W}
\vdots
s_{H1}s_{H2}\cdots s_{HW}


Here s_{ij} is the digit written in the square at the i-th row from the top and the j-th column from the left in the grid.

If multiple solutions exist, printing any of them will be accepted.

Examples

Input

3 3 1 1


Output

100
010
001


Input

1 5 2 0


Output

01010
import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
 
public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
 
    static int mod = 1_000_000_007;
    // int mod = 998244353;
    // long inf = Long.MAX_VALUE/2;
    int inf = Integer.MAX_VALUE/2;

    void solve(){
        int h = ni();
        int w = ni();
        int a = ni();
        int b = ni();
        // if(a*h!=b*w){
        //     out.println("No");
        //     return;
        // }
        // if(a==0){
        //     for(int i = 0; i < h; i++){
        //         for(int j = 0; j < w; j++){
        //             if(i<b) out.print(0);
        //             else out.print(1);
        //         }
        //         out.println();
        //     }
        //     return;
        // }
        // if(b==0){
        //     for(int i = 0; i < h; i++){
        //         for(int j = 0; j < w; j++){
        //             if(j<a) out.print(0);
        //             else out.print(1);
        //         }
        //         out.println();
        //     }
        //     return;
        // }
        int[][] board = new int[h][w];
        
        int[] next = new int[w];
        for(int i = 0; i < a; i++){
            next[i] = 1;
        }
        int c = 0;
        for(int i = 0; i < h; i++){
            for(int j = 0; j < w; j++){
                if(next[j]==1){
                    board[i][j] = 1;
                    c++;
                }
                else board[i][j] = 0;
            }
            next = new int[w];
            for(int j = c; j < c+a; j++){
                int d = j%w;
                next[d] = 1;
            }   
        }

        if(a*h!=b*w){
            int t = 0;
            for(int i = 0; i < h; i++){
                for(int j = 0; j < w; j++){
                    if(j<a) board[i][j] = t;
                    else board[i][j] = 1-t;
                }
                if(i==b-1) t = 1-t;
            }
        }

        // for(int i = 0; i < h; i++){
        //     int zero = 0;
        //     int one = 0;
        //     for(int j = 0; j < w; j++){
        //         if(board[i][j]==0) zero++;
        //         else one++;
        //     }
        //     if(Math.min(zero,one)!=a){
        //         out.println("No");
        //         return;
        //     }
        // }
        // for(int j = 0; j < w; j++){
        //     int zero = 0;
        //     int one = 0;
        //     for(int i = 0; i < h; i++){
        //         if(board[i][j]==0) zero++;
        //         else one++;
        //     }
        //     if(Math.min(zero,one)!=b){
        //         out.println("No");
        //         return;
        //     }
        // }
        for(int i = 0; i < h; i++){
            for(int j = 0; j < w; j++){
                out.print(board[i][j]);
            }
            out.println();
        }
    }

    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
 
}
