#include <bits/stdc++.h>
using namespace std;
int main() {
    long long n1, m1, n2, m2, k;
    cin >> n1 >> m1 >> n2 >> m2 >> k;
    vector<vector<int>> a(n1, vector<int>(m1));
    vector<vector<int>> b(n2, vector<int>(m2));
    for (int i = 0; i < n1; ++i) {
        for (int j = 0; j < m1; ++j) {
            cin >> a[i][j];
        }
    }
    for (int i = 0; i < n2; ++i) {
        for (int j = 0; j < m2; ++j) {
            cin >> b[i][j];
        }
    }
    int ci = -1, dj = -1;
    for (int i = 0; i < n2; ++i) {
        for (int j = 0; j < m2; ++j) {
            if (b[i][j] == 999999) {
                ci = i;
                dj = j;
            }
        }
    }
    int z = k; 
    if (ci > 0 && dj < m2) {
        z += b[ci - 1][dj];
    }
    if (ci < n2 - 1 && dj < m2) { 
        z += b[ci + 1][dj];
    }
    if (ci < n2 && dj > 0) {
        z += b[ci][dj - 1];
    }
    if (ci < n2 && dj < m2 - 1) { 
        z += b[ci][dj + 1];
    }
    int count = 0;
    if (ci > 0)  count++;
    if (ci < n2 - 1)  count++;
    if (dj > 0)  count++;
    if (dj < m2 - 1)  count++; 
    if (count > 0) {
        z /= (count + 1);
    }
    cout << z << endl;
    return 0;
}