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:
#include<cstdio>
#define neko 510
#define f(i,a,b) for(register int i=(a);i<=(b);i=-(~i))
int n,m,h,w,a[neko][neko],sum,p=2333;
int main()
{
	//特殊点是h*w的时候，普通点的1权重较小，当特殊点数大于后面多余的格子个数的时候就凉了
	scanf("%d%d%d%d",&n,&m,&h,&w);
	for(register int i=h;i<=n;i+=h)
	 for(register int j=w;j<=m;j+=w)
	  a[i][j]=-(h*w-1)*p-1;
	f(i,1,n)
	 f(j,1,m)
	  if(!a[i][j])a[i][j]=p,sum+=p;
	  else sum+=a[i][j];
	if(sum<=0)return printf("No\n"),0;
	printf("Yes\n");
	f(i,1,n)
	 f(j,1,m)printf("%d%c",a[i][j],j^m?' ':'\n');
}