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 <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long ll;

int H,W,h,w;
int g[505][500]={};

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	cin >> H >> W >> h >> w;
	swap(W,H);
	swap(w,h);
	ll sm = W*H;

	for(int i = 1; i <= W; ++i)
		for(int j = 1; j <= H; ++j)
			g[i][j] = 1;

	for(int i = w; i <= W; i += w) {
		for(int j = h; j <= H; j += h) {
			g[i][j] = -h*w;
			sm = sm-1-h*w;
		}
	}
	if(sm <= 0 && W%w == 0 && H%h == 0) cout << "No\n";
	else {
		while(sm <= 0) {
			for(int i = 1; i <= W; ++i) {
				for(int j = 0; j <= H; ++j) {
					sm -= g[i][j];
					if(g[i][j] > 0) g[i][j] = g[i][j]*2;
					else g[i][j] = g[i][j]*2+1;
					sm += g[i][j];
				}
			}
		}
		cout << "Yes\n";
		for(int i = 1; i <= W; ++i) {
			for(int j = 1; j <= H; ++j) {
				if(j!=1) cout << " ";
				cout << g[i][j];
			}
			cout << "\n";
		}
	}


	return 0;
}