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: Accepted)

#include <bits/stdc++.h>

#define FOR(i,k,n)  for(int i = (k);i < (n);++i)
#define REP(i,n)    FOR(i,0,n)
#define ALL(x)      begin(x),end(x)

using namespace std;

using vecint = vector<int>;
using ll = int64_t;

// ax+by=gcd(a,b)
// |x|+|y| -> min
// x <= y
ll extgcd(ll a, ll b, ll& x, ll& y) {
  ll g = a; x = 1; y = 0;
  if (b) g = extgcd(b, a%b, y, x), y -= (a / b) * x;
  return g;
}

int main()
{
  int H,W,h,w;
  cin>>H>>W>>h>>w;
  int h1 = H%h;
  int w1 = W%w;
  if (h1 == 0 && w1 == 0) {
    cout << "No" << endl;
    return 0;
  }
  cout << "Yes" << endl;
  int h2 = h-h1;
  int w2 = w-w1;
  int alpha = h*w-h2*w2;
  int beta = h2*w2;
  ll x,y;
  ll g = extgcd(alpha, beta, x, y);
  int pad = H*W-(H-h1)*(W-w1);
  int neg = g * (H/h) * (W/w);
  int lb = neg / pad;
  int n = (lb+x+beta-1)/beta+1;
  int p = beta*n-x;
  int q = -alpha*n-y;
  REP(i,H) {
    REP(j,W) {
      if (j) cout << ' ';
      if (i%h >= h1 && j%w >= w1) {
        cout << q;
      } else {
        cout << p;
      }
    }
    cout << endl;
  }
  return 0;
}