#include<bits/stdc++.h>
using namespace std;
int N, M, H, t, d[1010][1010], ans;
vector<pair<pair<int, int>, int> > v[1010][1010];
priority_queue<pair<int, pair<int, int> >, vector<pair<int, pair<int, int> > >, greater<pair<int, pair<int, int> > > > q;
int main(){
scanf("%d %d %d", &N, &M, &H);
for(int i = 0;i < N;i++){
for(int j = 0;j < M;j++){
d[i][j] = H;
}
}
for(int i = 0;i < N+1;i++){
for(int j = 0;j < M;j++){
scanf("%d", &t);
if(t == -1) continue;
if(i == 0){
q.push({t, {0, j}});
d[0][j] = t;
}
else if(i == N){
q.push({t, {N-1, j}});
d[N-1][j] = t;
}
else{
v[i-1][j].push_back({{i, j}, t});
v[i][j].push_back({{i-1, j}, t});
}
}
}
for(int i = 0;i < N;i++){
for(int j = 0;j < M+1;j++){
scanf("%d", &t);
if(t == -1) continue;
if(j == 0){
q.push({t, {i, 0}});
d[i][0] = t;
}
else if(j == M){
q.push({t, {i, M-1}});
d[i][M-1] = t;
}
else{
v[i][j-1].push_back({{i, j}, t});
v[i][j].push_back({{i, j-1}, t});
}
}
}
while(!q.empty()){
int q1 = q.top().first;
int qx = q.top().second.first;
int qy = q.top().second.second;
q.pop();
for(int i = 0;i < v[qx][qy].size();i++){
int nx = v[qx][qy][i].first.first;
int ny = v[qx][qy][i].first.second;
if(d[nx][ny] > max(q1, v[qx][qy][i].second)){
d[nx][ny] = max(q1, v[qx][qy][i].second);
q.push({d[nx][ny], {nx, ny}});
}
}
}
for(int i = 0;i < N;i++){
for(int j = 0;j < M;j++){
ans += d[i][j];
}
}
printf("%d", ans);
return 0;
}
