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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in Actual solution is at the top
 *
 * @author Silviase
 */
public class Main {

  public static void main(String[] args) {
    InputStream inputStream = System.in;
    OutputStream outputStream = System.out;
    Scanner in = new Scanner(inputStream);
    PrintWriter out = new PrintWriter(outputStream);
    A01MatrixTask solver = new A01MatrixTask();
    solver.solve(1, in, out);
    out.close();
  }

  static class A01MatrixTask {

    public void solve(int testNumber, Scanner in, PrintWriter out) {
      // h w a bなら...
        /*
        0000..01111..1 (a, w-a)
        0000..01111..1
        0000..01111..1
        1111..10000..0
        1111..10000..0
        1111..10000..0
        (b, h-b)
        各列についてa,が少なく,各行についてbが少ない.
         */

      int h, w, a, b;
      h = in.nextInt();
      w = in.nextInt();
      a = in.nextInt();
      b = in.nextInt();

      int[][] ar = new int[h][w];
      for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
          ar[i][j] = (i < b) ^ (j < a) ? 1 : 0;
        }
      }

      StringBuilder sb = new StringBuilder();
      for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
          sb.append(ar[i][j]);
        }
        sb.append("\n");
      }
      out.println(sb);

    }

  }
}

