Problem:
Score : 700 points

Problem Statement

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.

Sample Input 1

3 3 2 2

Sample Output 1

Yes
1 1 1
1 -4 1
1 1 1

The sum of all the elements of this matrix is 4, which is positive.
Also, in this matrix, there are four subrectangles with 2 rows and 2 columns as shown below. For each of them, the sum of all the elements inside is -1, which is negative.

Sample Input 2

2 4 1 2

Sample Output 2

No

Sample Input 3

3 4 2 3

Sample Output 3

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

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.Random;


public class Main {

  private int H, W, h, w;

  private int[][] solve1() {
    int hw = h * w;
    int[][] matrix = new int[H][W];
    for (int[] row : matrix) {
      Arrays.fill(row, 1);
    }
    for (int i = h - 1; i < H; i += h) {
      for (int j = w - 1; j < W; j += w) {
        matrix[i][j] = -hw;
      }
    }

    return matrix;
  }

  private int[][] solve2() {
    int hw = h * w;
    int[][] matrix = new int[H][W];
    for (int i = h - 1; i < H; i += h) {
      for (int j = w - 1; j < W; j += w) {
        matrix[i][j] = -hw;
      }
    }
    for (int i = 0; i < H; i += h) {
      for (int j = 0; j < W; j += w) {
        matrix[i][j] = hw - 1;
      }
    }

    return matrix;
  }

  private void test() {
    Random random = new Random();
    for (int i = 0; i < 10000; i++) {
      if (i % 10000 == 0) {
        System.out.println(i);
      }
      int p = 10;

      H = random.nextInt(p) + 1;
      W = random.nextInt(p) + 1;
      h = random.nextInt(H) + 1;
      w = random.nextInt(W) + 1;
      if (H % h == 0 && W % w == 0) {
        continue;
      }

      int[][] matrix = solve1();

      long sum = 0;
      for (int[] row : matrix) {
        for (int x : row) {
          sum += x;
        }
      }

      matrix = solve2();
      long sum2 = 0;
      for (int[] row : matrix) {
        for (int x : row) {
          sum2 += x;
        }
      }
      if (sum2 <= 0) {
        System.out.printf("%d %d %d %d", H, W, h, w);
        return;
      }
    }
  }

  private void solve(FastScanner in, PrintWriter out) {
//    test();
    H = in.nextInt();
    W = in.nextInt();
    h = in.nextInt();
    w = in.nextInt();

    int[][] matrix = solve1();
    if (check(matrix)) {
      print(out, matrix);
      return;
    }

    matrix = solve2();
    if (check(matrix)) {
      print(out, matrix);
      return;
    }
    out.println("No");
  }

  private boolean check(int[][] matrix) {

    long sum = 0;
    for (int[] row : matrix) {
      for (int x : row) {
        sum += x;
      }
    }
    return sum > 0;
  }

  private void print(PrintWriter out, int[][] matrix) {
    out.println("Yes");
    for (int[] row : matrix) {
      for (int x : row) {
        out.print(x + " ");
      }
      out.println();
    }
  }

  public static void main(String[] args) {
    PrintWriter out = new PrintWriter(System.out);
    new Main().solve(new FastScanner(), out);
    out.close();
  }

  private static class FastScanner {

    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int bufferLength = 0;

    private boolean hasNextByte() {
      if (ptr < bufferLength) {
        return true;
      } else {
        ptr = 0;
        try {
          bufferLength = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (bufferLength <= 0) {
          return false;
        }
      }
      return true;
    }

    private int readByte() {
      if (hasNextByte()) {
        return buffer[ptr++];
      } else {
        return -1;
      }
    }

    private static boolean isPrintableChar(int c) {
      return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) {
        ptr++;
      }
    }

    boolean hasNext() {
      skipUnprintable();
      return hasNextByte();
    }

    public String next() {
      if (!hasNext()) {
        throw new NoSuchElementException();
      }
      StringBuilder sb = new StringBuilder();
      int b = readByte();
      while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      }
      return sb.toString();
    }

    long nextLong() {
      if (!hasNext()) {
        throw new NoSuchElementException();
      }
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    }

    double nextDouble() {
      return Double.parseDouble(next());
    }

    double[] nextDoubleArray(int n) {
      double[] array = new double[n];
      for (int i = 0; i < n; i++) {
        array[i] = nextDouble();
      }
      return array;
    }

    double[][] nextDoubleMap(int n, int m) {
      double[][] map = new double[n][];
      for (int i = 0; i < n; i++) {
        map[i] = nextDoubleArray(m);
      }
      return map;
    }

    public int nextInt() {
      return (int) nextLong();
    }

    public int[] nextIntArray(int n) {
      int[] array = new int[n];
      for (int i = 0; i < n; i++) {
        array[i] = nextInt();
      }
      return array;
    }

    public long[] nextLongArray(int n) {
      long[] array = new long[n];
      for (int i = 0; i < n; i++) {
        array[i] = nextLong();
      }
      return array;
    }

    public String[] nextStringArray(int n) {
      String[] array = new String[n];
      for (int i = 0; i < n; i++) {
        array[i] = next();
      }
      return array;
    }

    public char[][] nextCharMap(int n) {
      char[][] array = new char[n][];
      for (int i = 0; i < n; i++) {
        array[i] = next().toCharArray();
      }
      return array;
    }

    public int[][] nextIntMap(int n, int m) {
      int[][] map = new int[n][];
      for (int i = 0; i < n; i++) {
        map[i] = nextIntArray(m);
      }
      return map;
    }
  }
}