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: Wrong Answer)

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

class Program
{
    static void Main()
    {
        var _ = Console.ReadLine().Split(' ').Select(long.Parse).ToArray();
        var H = _[0]; var W = _[1]; var h = _[2]; var w = _[3];

        if (h < 2 || w < 2)
        {
            Console.WriteLine("No");
            return;
        }

        var array = new long[h + 1, w + 1];
        var t1 = h + w - 1;
        var t2 = -t1 / ((h - 1) * (w - 1));

        for (var i = 0; i < h + 1; i++)
        {
            for (var j = 0; j < w + 1; j++)
            {
                if (i == 0 || j == 0 || i == h || j == w) array[i, j] = 1;
                else array[i, j] = t2;
            }
        }

        var t3 = t1 + t2 * (h - 1) * (w - 1);

        for (var i = 1; i < h && t3 >= 0; i++)
        {
            for (var j = 1; j < w && t3 >= 0; j++)
            {
                array[i, j]--; t3--;
            }
        }

        var ans = new long[H, W];

        for (var i = 0; i < H; i++)
        {
            for (var j = 0; j < W; j++)
            {
                ans[i, j] = array[i % h, j % w];
            }
        }

        if (ans.Cast<long>().Sum() <= 0)
        {
            Console.WriteLine("No");
            return;
        }

        Console.WriteLine("Yes");

        for (var i = 0; i < H; i++)
        {
            for (var j = 0; j < W; j++)
            {
                Console.Write(ans[i, j]);
                if (j < W) Console.Write(' ');
            }
            Console.WriteLine();
        }
    }
}