#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}

int ma[55][55] = {}, in[55][55];

signed main(void) {
    int w,h,tm;
    cin >> w >> h >> tm;
    int q;
    cin >> q;
    vi x(q),y(q),t(q);
    rep(i,q)cin >> x[i] >> y[i] >> t[i];
    rep(i,h)rep(j,w)cin >> in[i][j];
    rep(i,q){
        int b = x[i];
        int a = y[i];
        if(in[a][b])ma[a][b]++;
    }
    int ans = 0;
    rep(i,h)rep(j,w)ans += ma[i][j];
    cout << ans << endl;
}

