// Skyqwq
#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef pair<int, int> PII;
typedef long long LL;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N = 55, S = 105, Q = 1005;

int n, m, K, q, cnt;

struct E{
	int a, b;
} e[N][N];

LL ans = 0;

int f[N * N], sz[N * N];

int inline id(int x, int y) {
	return (x - 1) * m + y;
}

int find(int x) {
	return x == f[x] ? x : f[x] = find(f[x]);
}

void inline merge(int x, int y) {
	x = find(x), y = find(y);
	if (x == y) return;
	if (sz[x] > sz[y]) swap(x, y);
	f[x] = y, sz[y] += sz[x];
}


vector<int> mc;

bool st[S];

void inline init() {
	for (int i = 1; i <= n * m; i++) f[i] = i, sz[i] = 1;
	for (int i = 1; i <= K; i++) st[i] = 0;
}

bool ok = 0;

int inline olg() {
	init();
	mc.clear();
	int sum = 0; ok = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (!e[i][j].a) continue;
			if (i == 1 || (i > 1 && e[i - 1][j].a != e[i][j].a)) {
				int k = i;
				while (k < n && e[k + 1][j].a == e[i][j].a) k++;
				if (k - i + 1 >= 3) {
					ok = 1;
					int co = e[i][j].a;
					if (!st[co]) st[co] = 1, mc.pb(co);
					for (int u = i + 1; u <= k; u++)
						merge(id(u, j), id(i, j));
				}
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (!e[i][j].a) continue;
			if (j == 1 || (j > 1 && e[i][j - 1].a != e[i][j].a)) {
				int k = j;
				while (k < m && e[i][k + 1].a == e[i][j].a) k++;
				if (k - j + 1 >= 3) {
					int co = e[i][j].a;
					ok = 1;
					if (!st[co]) st[co] = 1, mc.pb(co);
					for (int u = j + 1; u <= k; u++)
						merge(id(i, u), id(i, j));
				}
			}
		}
	}
	for (int i = 1; i <= n; i++) 
		for (int j = 1; j <= m; j++) {
			if (i < n && e[i][j].a == e[i + 1][j].a &&  sz[find(id(i, j))] > 1 && sz[find(id(i + 1, j))] > 1)
				merge(id(i, j), id(i + 1, j));
			if (j < m && e[i][j].a == e[i][j + 1].a && sz[find(id(i, j))] > 1 && sz[find(id(i, j + 1))] > 1)
				merge(id(i, j), id(i, j + 1));
			
		}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			int u = id(i, j);
			if (find(u) == u && sz[u] > 1) {
				sum += (sz[u] - 3) * (sz[u] - 3) * 50;
			}
		}
	}
	return sum;
}

vector<vector<int> > z;

bool de[N][N];

void inline del(int x, int y) {
	if (x < 1 || x > n || y < 1 || y > m) return;
	if (!e[x][y].a) return;
	if (de[x][y]) return;
	de[x][y] = 1;
	ans += cnt * e[x][y].a;
	if (e[x][y].b) {
		int tp = e[x][y].b;
		//cout << x << " " << y << " st to " << tp << endl;
		if (tp == 1) {
			for (int j = 1; j <= m; j++)
				del(x, j);
		} else if (tp == 2) {
			for (int i = 1; i <= n; i++)
				del(i, y);
		} else if (tp == 3) {
			for (int j = 1; j <= m; j++)
				del(x, j);
			for (int i = 1; i <= n; i++)
				del(i, y);
		} else if (tp == 4) {
			for (int i = -1; i <= 1; i++)
				for (int j = -1; j <= 1; j++)
					del(x + i, y + j);
		} else if (tp == 5) {
			for (int i = -2; i <= 2; i++)
				for (int j = -2; j <= 2; j++)
					del(x + i, y + j);
		} else {
			for (int i = 1; i <= n; i++)
				for (int j = 1; j <= m; j++)
					if (e[i][j].a == e[x][y].a) del(i, j);
		}
	}
	e[x][y].a = e[x][y].b = 0;
}

void inline down() {
	for (int j = 1; j <= m; j++) {
		int R = n;
		for (int i = n; i; i--) {
			if (e[i][j].a) {
				e[R--][j] = e[i][j];
			}
		}
		for (int i = 1; i <= R; i++) e[i][j].a = e[i][j].b = 0;
	}
}

void inline work() {
	memset(de, 0, sizeof de);
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (sz[find(id(i, j))] > 1)
				del(i, j);
		}
	}
	down();
}

int mx = 0;

int inline gaopai(vector<int> w) {
	for (int i = 0; i + 1 < w.size(); i++)
		if (w[i] == w[i + 1]) return -1;
	int s = 50;
	assert(w.size() == 5);
	s += w[4];
	return s;
}

int inline yidui(vector<int> w) {
	int num = 0, bh = 0;
	for (int i = 0; i + 1 < w.size(); i++)
		if (w[i] == w[i + 1]) {
			num++;
			bh = w[i];
		}
	if (num != 1) {
		return -1;
	}
	int s = 100 + bh * 2;
	return s;
}

int inline liangdui(vector<int> w) {
	int num = 0, bh = 0;
	vector<int> o;
	for (int i = 0; i + 1 < w.size(); i++) {
		if (w[i] == w[i + 1]) {
			num++;
			o.pb(w[i]);
			if (i + 2 < w.size() && w[i + 1] == w[i + 2]) {
				return -1;
			}
		}
	}
	if (num != 2) {
		return -1;
	}
	int s = 200 + o[1] * 2 + o[0];
	return s;
}

int inline santiao(vector<int> w) {
	int num = 0, bh = 0;
	for (int i = 0; i + 1 < w.size(); i++) {
		if (w[i] == w[i + 1]) {
			num++;
			if (i + 2 < w.size() && w[i + 1] == w[i + 2]) {
				bh = w[i];
			}
		}
	}
	if (num != 2 || !bh) {
		return -1;
	}
	int s = 300 + bh * 3;
	return s;
}

int inline hulu(vector<int> w) {
	int num = 0, bh = 0;
	for (int i = 0; i + 1 < w.size(); i++) {
		if (w[i] == w[i + 1]) {
			num++;
			if (i + 3 < w.size() && w[i + 1] == w[i + 2]&& w[i + 2] == w[i + 3]) {
				return -1;
			}
			if (i + 2 < w.size() && w[i + 1] == w[i + 2]) {
				bh = w[i];
			}
		}
	}
	int p = 0;
	while (p < 5 && w[p] == bh) p++;
	if (num != 3 || !bh || p == 5) {
		return -1;
	}
	int s = 500 + bh * 3 + w[p];
	return s;
}

int inline sitiao(vector<int> w) {
	int num = 0, bh = 0;
	for (int i = 0; i + 1 < w.size(); i++) {
		if (w[i] == w[i + 1]) {
			num++;
			if (i + 3 < w.size() && w[i + 1] == w[i + 2]&& w[i + 2] == w[i + 3]) {
				bh = w[i];
			}
		}
	}
	if (num != 3 || !bh) {
		return -1;
	}
	int s = 750 + bh * 5;
	return s;
}

int inline wutiao(vector<int> w) {
	int num = 0, bh = 0;
	for (int i = 0; i + 1 < w.size(); i++) {
		if (w[i] == w[i + 1]) {
			num++;
		}
	}
	if (num != 4) {
		return -1;
	}
	int s = 1000 + w[0] * 10;
	return s;
}

int calc(vector<int> w) {
	sort(w.begin(), w.end());
	int w1 = gaopai(w);

	if (w1 != -1) {
		return w1;
	}
	w1 = yidui(w);
	if (w1 != -1) {
		return w1;
	}
	w1 = liangdui(w);
	if (w1 != -1) {
		return w1;
	}
	w1 = santiao(w);
	if (w1 != -1) {
		return w1;
	}
	w1 = wutiao(w);
	if (w1 != -1) {
		return w1;
	}
	w1 = sitiao(w);
	if (w1 != -1) {
		return w1;
	}
	
	w1 = hulu(w);
	if (w1 != -1) {
		return w1;
	}
	
	assert(false);
}

void dfs(int u, vector<int> now) {
	if (u == z.size()) {
		chkMax(mx, calc(now));
		return;
	}
	for (int v: z[u]) {
		now.pb(v);
		dfs(u + 1, now);
		now.pop_back();
	}
}

void inline red() {
	mx = -2e9;
	vector<int> now;
	dfs(0, now);
	//cout << mx << " jf\n";
	ans += mx;
	z.clear();
}

int main() {
    read(n), read(m); read(K), read(q);
    for (int i = 1; i <= n; i++)
    	for (int j = 1; j <= m; j++) read(e[i][j].a);
    for (int i = 1; i <= n; i++)
    	for (int j = 1; j <= m; j++) read(e[i][j].b);
    int yx = 0;
    for (int i = 1; i <= q; i++) {
    	int x1, y1, x2, y2; read(x1), read(y1), read(x2), read(y2);
    	if (abs(x1 - x2) + abs(y1 - y2) != 1) continue;
		if (!e[x1][y1].a || !e[x2][y2].a) continue;
		swap(e[x1][y1], e[x2][y2]);
    	int w = olg();
    	int la = ans;
    	if (ok) {
    		++yx;
    		cnt = 0;
    		z.pb(mc);
    		int sumC = 0;
    		while (1) {
    			w = olg();
    			if (!ok) break;
    			//cout << w << "madan\n";
    			ans += w;
    			++cnt;
    			work();
    			sumC++;
    			// cout << "-=--=-=" << cnt << endl;
    			// for (int i = 1; i <= n; i++) {
    			// 	for (int j = 1; j <= m; j++) {
    			// 		cout << e[i][j].a << " ";
    			// 	}
    			// 	cout << endl;
    			// }
    			// puts("---");
    		}
    		ans += (sumC - 1) * (sumC - 1) * 80;
    	} else {
    		swap(e[x1][y1], e[x2][y2]);
    	}
    	//cout << i << "->>>" << ans - la << endl;
    	if (z.size() == 5) red();
    }
    if (yx == q) ans += 1000;
    int num = 0;
    for (int i = 1; i <= n; i++)
    	for (int j = 1; j <= m; j++) if (e[i][j].a) num++;
    if (!num) ans += 10000;
    printf("%lld\n", ans);
    return 0;
}