/******************************************
*    AUTHOR:         BHUVNESH JAIN        *
*    INSTITUITION:   BITS PILANI, PILANI  *
******************************************/
#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int,int> pii;
typedef pair<int, int> pll;

#define fi			first
#define sec 		second

const int MAX = 1e3 + 3;

int n, m, q;
int a[MAX][MAX];
int du[4] = {1, 1, -1, -1};
int dv[4] = {1, -1, 1, -1};
int dx[MAX], dy[MAX];
map<int, int> dp[MAX][MAX];

int solve(int x, int y, int mask) {
	// cerr << x << " " << y << " " << mask << "\n";
	if (mask == (1<<q)-1) {
		return a[x][y];
	}
	if (dp[x][y].find(mask) != dp[x][y].end()) {
		return dp[x][y][mask];
	}
	int res = 0, val;
	for(int i = 0; i < q; ++i) {
		if (mask&(1<<i)) {
			//
		}
		else {
			for(int j = 0; j < 4; ++j) {
				int _x = x + dx[i] * du[j];
				int _y = y + dy[i] * dv[j];
				if (_x >= 0 && _x < n && _y >= 0 && _y < m) {
					val = solve(_x, _y, mask | (1<<i));
					res = max(val, res);
				}
			}
		}
	}
	return (dp[x][y][mask] = a[x][y] + res);
}

int main() {
	#ifndef ONLINE_JUDGE
		freopen("inp2.txt", "r", stdin);
	#endif
	int t;
	scanf("%d", &t);
	while(t--) {
		scanf("%d %d %d", &n, &m, &q);
		int sx, sy;
		scanf("%d %d", &sx, &sy);
		for(int i = 0; i < q; ++i) {
			scanf("%d", &dx[i]);
		}
		for(int i = 0; i < q; ++i) {
			scanf("%d", &dy[i]);
		}
		for(int i = 0; i < n; ++i) {
			for(int j = 0; j < m; ++j) {
				scanf("%d", &a[i][j]);
				dp[i][j].clear();
			}
		}
		int ans = solve(sx, sy, 0);
		printf("%d\n", ans);
	}
	return 0;
}