#include <iostream>
#include <vector>
using namespace std;
#define endl '\n'
long long n, m, klk, r, c, res, all, b;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> m;
vector<vector<long long>> k(n+2, vector<long long>(m+2));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) cin >> k[i][j];
}
cin >> klk;
b = 0;
res = 0;
for (int i = 1; i <= klk; i++) {
cin >> r >> c;
if ((r == 0 && c == 0) || (r == 0 && c == m - 1) || (r == n - 1 && c == 0) || (r == n - 1 && c == m - 1)) b = 1;
else {
all = k[r][c] + k[r - 1][c] + k[r + 1][c] + k[r][c - 1] + k[r][c + 1];
res += all - min(k[r - 1][c], min(k[r + 1][c], min(k[r][c - 1], k[r][c + 1])));
}
}
if (b == 1) cout << "No";
else cout << res;
return 0;
}
