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>
using namespace std;
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)),UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a+mod-b)%mod
#define MUL(a, b) a = (a * b) % mod
#define repi(i,m,n) for(int i = m;i < n;i++)
#define drep(i,n,m) for(int i = n;i >= m;i--)
#define rep(i,n) repi(i,0,n)
#define rrep(i,n) repi(i,1,n+1)
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(), v.rend()
#define dmp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define fi first
#define se second
typedef pair<int,int> P;
typedef pair<int, P> PP;
typedef pair<P, int> Pi;
typedef vector<int> vi;
typedef deque<int> dq;
const int inf = 1e9+7;
const int INF = 1e18+7;

int a[1000][1000], rui[1000][1000];
signed main(){
	int H, W, h, w;
	scanf("%lld%lld%lld%lld", &H, &W, &h, &w);
	rrep(i,H)rrep(j,W){
		if(i%h == 1 and j%w == 1)a[i][j] = inf-1;
		if(i%h == 0 and j%w == 0)a[i][j] = -inf;
	}
	//rrep(i,H)rrep(j,W)a[i][j] = 1;
	//rrep(i,H)rrep(j,W)if(i%h == 0 and j%w == 0)a[i][j] = -h*w;
	rrep(i,H)rrep(j,W)rui[i][j] = a[i][j];
	rrep(i,H)rrep(j,W)rui[i][j] += rui[i][j-1];
	rrep(i,H)rrep(j,W)rui[i][j] += rui[i-1][j];
	rrep(i,H)rrep(j,W){
		if(i-h < 0 or j-w < 0)continue;
		int sum = rui[i][j]+rui[i-h][j-w]-rui[i-h][j]-rui[i][j-w];
		if(sum >= 0){printf("No\n");return 0;}
	}
	int sum = rui[H][W]+rui[0][0]-rui[0][W]-rui[H][0];
	if(sum <= 0){printf("No\n");return 0;}
	printf("Yes\n");
	rrep(i,H){
		rrep(j,W)printf("%lld%c", a[i][j], j == W ? '\n' : ' ');
	}
	return 0;
}