Problem: You are given four integers: H, W, h and w (1 ≤ h ≤ H, 1 ≤ w ≤ W). Determine whether there exists a matrix such that all of the following conditions are held, and construct one such matrix if the answer is positive:

* The matrix has H rows and W columns.
* Each element of the matrix is an integer between -10^9 and 10^9 (inclusive).
* The sum of all the elements of the matrix is positive.
* The sum of all the elements within every subrectangle with h rows and w columns in the matrix is negative.

Constraints

* 1 ≤ h ≤ H ≤ 500
* 1 ≤ w ≤ W ≤ 500

Input

Input is given from Standard Input in the following format:


H W h w


Output

If there does not exist a matrix that satisfies all of the conditions, print `No`.

Otherwise, print `Yes` in the first line, and print a matrix in the subsequent lines in the following format:


a_{11} ... a_{1W}
:
a_{H1} ... a_{HW}


Here, a_{ij} represents the (i,\ j) element of the matrix.

Examples

Input

3 3 2 2


Output

Yes
1 1 1
1 -4 1
1 1 1


Input

2 4 1 2


Output

No


Input

3 4 2 3


Output

Yes
2 -5 8 7
3 -5 -4 -5
2 1 -1 7

Solution (in JAVA):

Solution:
/**
 * @author Finn Lidbetter
 */
import java.util.*;
import java.io.*;
import java.awt.geom.*;

public class Main {
  public static void main(String[] args) throws IOException {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringBuilder sb = new StringBuilder();
    String[] s = br.readLine().split(" ");
    int H = Integer.parseInt(s[0]);
    int W = Integer.parseInt(s[1]);
    int h = Integer.parseInt(s[2]);
    int w = Integer.parseInt(s[3]);

    if (h==1 && w==1) {
      System.out.println("No");
      System.exit(0);
    }
    int neg = -h*w;
    int[][] mat = new int[H][W];
    int sum =0;
    for (int i=0; i<H; i++) {
      for (int j=0; j<W; j++) {
        mat[i][j] = 1;
        if ((i+1)%h==0 && (j+1)%w==0) {
          mat[i][j] = neg;
        }
        sum += mat[i][j];
      }
    }
    if (sum>0) {
      System.out.println("Yes");
      for (int i=0; i<H; i++) {
        for (int j=0; j<W; j++) {
          sb.append(mat[i][j]);
          sb.append(" ");
        }
        sb.delete(sb.length()-1, sb.length());
        sb.append("\n");
      }
      System.out.print(sb);
    } else {
      for (int i=0; i<H; i++) {
        Arrays.fill(mat[i],0);
      }
      sum = 0;
      for (int i=0; i<H; i++) {
        for (int j=0; j<W; j++) {
          if ((i+1)%h==0 && (j+1)%w==0) {
            mat[i][j] = neg-1000;
          } else if (i%h==0 && j%w==0) {
            mat[i][j] = 1001;
          } else {
            mat[i][j] = 1;
          }
          sum += mat[i][j];
        }
      }

      if (sum>0) {
        System.out.println("Yes");
        for (int i=0; i<H; i++) {
          for (int j=0; j<W; j++) {
            sb.append(mat[i][j]);
            sb.append(" ");
          }
          sb.delete(sb.length()-1, sb.length());
          sb.append("\n");
        }
        System.out.print(sb);
      } else {
        System.out.println("No");
      }
    }
  }
}