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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <climits>
using namespace std;

vector<int> solve(int N, int n){
    vector<int> sm(N+1, -1);
    sm[N] = 1;
    for(int i=N-n; i>=0; i-=n)
        sm[i] = sm[i+n] + 1;

    for(int i=0; i<N; i++){
        if(sm[i] != -1) break;
        sm[i] = 0;
        for(int j=i+n; j<N; j+=n)
            sm[j] = sm[j-n] - 1;
    }

    vector<int> vec(N, 0);
    for(int i=0; i<N; i++) vec[i] = sm[i+1] - sm[i];

    return vec;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int H, W, h, w;
    cin >> H >> W >> h >> w;
    if(H % h == 0 && W % w == 0){
        cout << "No" << endl;
        return 0;
    }
    cout << "Yes" << endl;

    vector<int> vec;
    if(W % w != 0) vec = solve(W, w);
    else vec = solve(H, h);

    if(W % w != 0){
        for(int i=0; i<H; i++){
            for(int j=0; j<W; j++)
                cout << vec[j] << " ";
            cout << endl;
        }
    }else{
        for(int i=0; i<H; i++){
            for(int j=0; j<W; j++)
                cout << vec[i] << " ";
            cout << endl;
        }
    }

    return 0;
}