#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define f first
#define s second
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define imp cout<<-1<<"\n"
#define pb push_back
#define pii pair<int,int>
#define piii pair<int,pair<int,int>>
#define ls v<<1
#define rs v<<1|1
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define ptree tree *
const int mod=1e17+3;
const int INF = 1e18;
const int N=1e5+50;
const int logn=18;
mt19937_64 rng(14416513);
void solve(){
int n,k,q;
cin>>n>>k;
int sum=0;
vector<vector<int>>v(n,vector<int>(k));
for(int i=0;i<n;i++){
for(int j=0;j<k;j++){
cin>>v[i][j];
}
}
cin>>k;
for(int i=0;i<k;i++){
int a,b;
cin>>a>>b;
sum+=v[a][b];
sum+=v[a+1][b];
sum+=v[a][b+1];
sum+=v[a-1][b];
sum+=v[a][b-1];
sum-=min({v[a+1][b],v[a-1][b],v[a][b+1],v[a][b-1]});
}
cout<<sum<<"\n";
}
signed main(){
fast;
int t=1;
// cin>>t;
while(t--){
solve();
}
return 0;
}
