#include <bits/stdc++.h>
#define PB push_back
#define EB emplace_back
using namespace std;
typedef long long i64;
const int maxn = 30;
int n, m, L, R;
int a[maxn + 5][maxn + 5], b[maxn + 5][maxn + 5];
i64 f1[maxn + 1][maxn + 1][maxn + 1][maxn + 1][maxn + 1], f2[maxn + 1][maxn + 1][maxn + 1][maxn + 1][maxn + 1];
inline void upd(i64& x, i64 y) { x = min(x, y); }
void solve(i64 f[][maxn + 1][maxn + 1][maxn + 1][maxn + 1], int v[][maxn + 5]) {
	f[0][0][0][0][0] = 0;
	for (int i = 1; i <= n; i++)
		for (int j = i - 1; ~j; j--)
			for (int k = i - j - 1; ~k; k--)
				for (int x = j; x <= m; x++)
					for (int y = k; x + y <= m; y++) {
						i64 nw = f[i - 1][j][k][x][y];
						if (nw >= 1E18) continue;
						f[i][j][k][x][y] = nw + v[i][0];
						for (int z = 1; x + y + z <= m; z++) {
							upd(f[i][j + 1][k][x + z][y], nw + v[i][z]);
							upd(f[i][j][k + 1][x][y + z], nw + v[i][z]);
						}
					}
}
void plan(i64 f[][maxn + 1][maxn + 1][maxn + 1][maxn + 1], int v[][maxn + 5], int j, int k, int x, int y, int bl[], int deg[]) {
	for (int i = n; i; i--) {
		if (f[i][j][k][x][y] == f[i - 1][j][k][x][y] + v[i][0]) { bl[i] = 1, deg[i] = 0; goto ed; }
		if (j) {
			for (int z = 1; z <= x; z++)
				if (f[i][j][k][x][y] == f[i - 1][j - 1][k][x - z][y] + v[i][z]) {
					bl[i] = 0, deg[i] = z;
					j--, x -= z;
					goto ed;
				}
		}
		if (k) {
			for (int z = 1; z <= y; z++)
				if (f[i][j][k][x][y] == f[i - 1][j][k - 1][x][y - z] + v[i][z]) {
					bl[i] = 1, deg[i] = z;
					k--, y -= z;
					goto ed;
				}
		}
		ed:; 
	}
}
int bl1[maxn + 5], bl2[maxn + 5];
int deg1[maxn + 5], deg2[maxn + 5];
int main() {
	scanf("%d%d%d%d", &n, &m, &L, &R);
	if (m < L || !R) return puts("NO"), 0;
	for (int i = 1; i <= n; i++)
		for (int j = 0; j <= m; j++) scanf("%d", &a[i][j]);
	for (int i = 1; i <= n; i++)
		for (int j = 0; j <= m; j++) scanf("%d", &b[i][j]);
	memset(f1, 63, sizeof(f1)), memset(f2, 63, sizeof(f2));
	solve(f1, a), solve(f2, b);
	i64 ans = 1E18;
	int _1, _2, _3, _4, _5, _6, _7, _8;
	for (int i = 0; i <= R; i++)
		for (int j = 0; i + j <= n; j++)
			for (int k = max(L - i, 0); k <= min(R - i, j); k++)
				for (int l = i; k + l <= n; l++)
					for (int x = i; x <= m - j; x++) {
						i64 nw = f1[n][i][j][x][m - x];
						if (nw >= 1E18) continue;
						for (int y = max(k, m - x); y <= m - l; y++)
							if (nw + f2[n][k][l][y][m - y] < ans) {
								ans = nw + f2[n][k][l][y][m - y];
								_1 = i, _2 = j, _3 = x, _4 = m - x, _5 = k, _6 = l, _7 = y, _8 = m - y; 
							}
					}
	printf("YES\n%lld\n", ans);
	plan(f1, a, _1, _2, _3, _4, bl1, deg1);
	plan(f2, b, _5, _6, _7, _8, bl2, deg2);
	for (int i = 1, j = 1; i <= n; i++) {
		if (bl1[i]) continue;
		while (!bl2[j] || !deg2[j]) j++;
		printf("%d %d\n", i, j + n);
		deg1[i]--, deg2[j++]--;
	}
	for (int i = 1, j = 1; i <= n; i++) {
		if (bl2[i]) continue;
		while (!bl1[j] || !deg1[j]) j++;
		printf("%d %d\n", j, i + n);
		deg2[i]--, deg1[j++]--;
	}
	for (int i = 1, j = 1; i <= n; i++) {
		if (!bl1[i]) continue;
		while (deg1[i]) {
			while (bl2[j] || !deg2[j]) j++;
			printf("%d %d\n", i, j + n);
			deg1[i]--, deg2[j]--;
		}
	}
	for (int i = 1, j = 1; i <= n; i++) {
		if (!bl2[i]) continue;
		while (deg2[i]) {
			while (bl1[j] || !deg1[j]) j++;
			printf("%d %d\n", j, i + n);
			deg2[i]--, deg1[j]--;
		}
	}
	for (int i = 1, j = 1; i <= n; i++) {
		if (bl1[i]) continue;
		while (deg1[i]) {
			while (!deg2[j]) j++;
			printf("%d %d\n", i, j + n);
			deg1[i]--, deg2[j]--;
		}
	}
}