#include <bits/stdc++.h>
#include <cmath>
using namespace std;
typedef unsigned long long ll;
#define pii pair<int,int>
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>>vec(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> vec[i][j];
}
}
int k;
cin >> k;
vector<pii>spe(k);
for (int i = 0; i < k; i++)
cin >> spe[i].first >> spe[i].second;
ll ans = 0;
for (int i = 0; i < k; i++) {
vector<int>vec1;
vec1.push_back(vec[spe[i].first][spe[i].second]);
if (spe[i].first < n - 1)
vec1.push_back(vec[spe[i].first + 1][spe[i].second]);
if (spe[i].first > 0)
vec1.push_back(vec[spe[i].first - 1][spe[i].second]);
if (spe[i].second < m - 1)
vec1.push_back(vec[spe[i].first][spe[i].second + 1]);
if (spe[i].second > 0)
vec1.push_back(vec[spe[i].first][spe[i].second - 1]);
sort(vec1.begin(), vec1.end());
int j = vec1.size() - 1;
int tmp = 4;
while (tmp--) {
ans += vec1[j];
j--;
}
vec1.resize(0);
}
cout << ans;
}
