#include <bits/stdc++.h>
using namespace std;
const int N = 55;
int n, m, k, q, X1, Y1, X2, Y2, d[N][N], v[N][N], hd, tl, qx[N*N], qy[N*N], t, mc[6][2], c[N*2], all = 1000, mx, ans;
struct node {
	int c, t;
	node () {}
	node (int _c, int _t) : c (_c), t (_t) {}
	operator int () const { return c; }
	bool operator < (const node &a) const {
		return c < a. c || c == a. c && t < a. t;
	}
} a[N][N], p[6];
void dfs1(int x, int y, int t) {
	if (t == 1 || t == 3)
		for (int j=1; j<=m; j++)
			if (! d[x][j]) {
				d[x][j] = 1;
				if (a[x][j]. t)
					dfs1(x, j, a[x][j]. t);
			}
	if (t == 2 || t == 3)
		for (int i=1; i<=n; i++)
			if (! d[i][y]) {
				d[i][y] = 1;
				if (a[i][y]. t)
					dfs1(i, y, a[i][y]. t);
			}
	if (t == 4 || t == 5)
		for (int i=3-t+x; i<=t-3+x; i++)
			for (int j=3-t+y; j<=t-3+y; j++)
				if (i > 0 && i <= n && j > 0 && j <= m && ! d[i][j]) {
					d[i][j] = 1;
					if (a[i][j]. t)
						dfs1(i, j, a[i][j]. t);
				}
	if (t == 6)
		for (int i=1; i<=n; i++)
			for (int j=1; j<=m; j++)
				if (a[i][j] == a[x][y] && ! d[i][j]) {
					d[i][j] = 1;
					if (a[i][j]. t)
						dfs1(i, j, a[i][j]. t);
				}
}
void dfs2(int t) {
	if (t > 5) {
		int n = 0, s;
		for (int i=1; i<=k; i++)
			if (c[i])
				p[++n] = node (c[i], i);
		sort (p+1, p+n+1);
		if (n == 1) s = 1000 + p[1]. t * 10;
		else if (n == 2 && p[2] == 4) s = 750 + p[2]. t * 5;
		else if (n == 2) s = 500 + p[2]. t * 3 + p[1]. t;
		else if (n == 3 && p[3] == 3) s = 300 + p[3]. t * 3;
		else if (n == 3) s = 200 + p[3]. t * 2 + p[2]. t;
		else if (n == 4) s = 100 + p[4]. t * 2;
		else s = 50 + p[5]. t;
		mx = max(mx, s);
		return ;
	}
	for (int i=0; i<=1; i++)
		if (mc[t][i])
			c[mc[t][i]] ++, dfs2(t + 1), c[mc[t][i]] --;
}
int main() {
	cin >> n >> m >> k >> q;
	for (int i=1; i<=n; i++)
		for (int j=1; j<=m; j++)
			scanf ("%d", &a[i][j]. c);
	for (int i=1; i<=n; i++)
		for (int j=1; j<=m; j++)
			scanf ("%d", &a[i][j]. t);
	while (q --) {
		scanf ("%d%d%d%d", &X1, &Y1, &X2, &Y2);
		if (! a[X1][Y1] || ! a[X2][Y2])
			{ all = 0; continue; }
		swap(a[X1][Y1], a[X2][Y2]);
		int mc[2] {};
		for (int l=1; ; l++) {
			for (int i=1; i<=n; i++)
				for (int j=1; j<=m; j++)
					d[i][j] = ! a[i][j], v[i][j] = 0;
			for (int i=1; i<=n; i++)
				for (int j=1; j<=m; j++) {
					if (i < n - 1 && a[i][j] == a[i+1][j] && a[i][j] == a[i+2][j])
						d[i][j] = d[i+1][j] = d[i+2][j] = 1;
					if (j < m - 1 && a[i][j] == a[i][j+1] && a[i][j] == a[i][j+2])
						d[i][j] = d[i][j+1] = d[i][j+2] = 1;
				}
			bool f = 0;
			for (int i=1; i<=n; i++)
				for (int j=1; j<=m; j++)
					if (d[i][j] && a[i][j]) {
						f = 1;
						if (l == 1)
							mc[mc[0]&&mc[0]!=a[i][j]] = a[i][j];
						if (! v[i][j]) {
							qx[hd=tl=1] = i, qy[1] = j, v[i][j] = 1;
							while (hd <= tl) {
								int x = qx[hd], y = qy[hd++];
								for (int k=0; k<=3; k++) {
									int xx = x + (k & 1 ? 0 : k - 1), yy = y + (k & 1 ? k - 2 : 0);
									if (d[xx][yy] && a[xx][yy] == a[x][y] && ! v[xx][yy])
										qx[++tl] = xx, qy[tl] = yy, v[xx][yy] = 1;
								}
							} ans += 50 * (tl - 3) * (tl - 3);
						}
					}
			if (! f) break;
			ans += max(160 * l - 240, 0);
			for (int i=1; i<=n; i++)
				for (int j=1; j<=m; j++)
					if (d[i][j] && a[i][j]. t)
						dfs1(i, j, a[i][j]. t);
			for (int i=1; i<=n; i++)
				for (int j=1; j<=m; j++)
					if (d[i][j])
						ans += a[i][j] * l;
			for (int j=1; j<=m; j++) {
				int _ = n;
				for (int i=n; i; i--)
					if (! d[i][j])
						a[_--][j] = a[i][j];
				while (_)
					a[_--][j] = node (0, 0);
			}
		}
		if (! mc[0])
			{ all = 0, swap(a[X1][Y1], a[X2][Y2]); continue; }
		:: mc[++t][0] = mc[0], :: mc[t][1] = mc[1];
		if (t == 5)
			mx = 0, dfs2(1), ans += mx, t = 0;
	} ans += all + 10000;
	for (int i=1; i<=n; i++)
		for (int j=1; j<=m; j++)
			if (a[i][j])
				{ ans -= 10000; goto E; }
	E : cout << ans;
}