#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <memory.h>
#include <vector>

using namespace std;
typedef long long LL;
const int maxn = 505;
const int A = 1000;

int n,m,h,w;
int main()
{
	#ifdef Amberframe
		freopen("agc016c.in","r",stdin);
		freopen("agc016c.out","w",stdout);
	#endif
	scanf("%d %d %d %d",&n,&m,&h,&w);
	if (n%h||m%w) {
		puts("Yes");
		int B=-(h*w-1)*A-1;
		for (int i=1;i<=n;i++)
		for (int j=1;j<=m;j++)
			printf("%d%c",(i%h||j%w)?A:B," \n"[j==m]);
	}
	else puts("No");
	return 0;
}