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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace AtCoder
{
    class Program
    {
        private static int[][] Solve(int H, int W, int h, int w)
        {
            if (h * w == 1) { return null; }
            int[][] matrix = new int[H][];
            long sum = 0;
            int n = 999999999 / (h * w - 1);
            for (int i = 0; i < H; ++i)
            {
                matrix[i] = new int[W];
                for (int j = 0; j < W; ++j)
                {
                    int value = (i % h == h - 1 && j % w == w - 1) ? -1000000000 : n;
                    matrix[i][j] = value;
                    sum += value;
                }
            }
            return (sum > 0) ? matrix : null;
        }
        static void Main(string[] args)
        {
            int[] values = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
            var matrix = Solve(values[0], values[1], values[2], values[3]);
            if (matrix != null)
            {
                Console.WriteLine("Yes");
                foreach (int[] row in matrix) { Console.WriteLine(string.Join(" ", row)); }
            }
            else
            {
                Console.WriteLine("No");
            }
        }
    }
}