Problem: 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.

Examples

Input

3 3 2 2


Output

Yes
1 1 1
1 -4 1
1 1 1


Input

2 4 1 2


Output

No


Input

3 4 2 3


Output

Yes
2 -5 8 7
3 -5 -4 -5
2 1 -1 7

Solution (in CPP):

Solution:
//2018-1-17
//miaomiao
//
#include <bits/stdc++.h>
using namespace std;
 
#define For(i, a, b) for(int i = (a); i <= (int)(b); ++i)
#define N (500+5)

int mat[N][N];

int main(){
	int n, m, w, h;
	scanf("%d%d%d%d", &n, &m, &w, &h);
	
	For(i, 1, n) For(j, 1, m) mat[i][j] = 1000;

	long long tmp = 0;
	int tt = -1000*w*h+999;
	for(int i = w; i <= n; i += w)
	  for(int j = h; j <= m; j += h) mat[i][j] = tt, ++tmp;

	if((1ll*n*m*1000-tmp*1000) <= abs(tmp*tt)){
		puts("No"); return 0;
	}

	puts("Yes");
	For(i, 1, n) For(j, 1, m) printf("%d%c", mat[i][j], j==m? '\n': ' ');
	
	return 0;
}