/** kutbilim.one **/
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(),x.end()
//#define int long long
#define endl '\n'
/*
ifstream in("test.txt");
#define cin in */
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m, r, k, p;
cin >> n >> m >> r >> k >> p;
int a[1+n][1+m];
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++) cin >> a[i][j];
vector<int> maxi(n+1, -1), maxj(m+1, -1);
while(k--){
char side;
int pos, h;
cin >> side >> pos >> h;
int shots = r;
if(side == 'W' && (maxi[pos] == -1 || maxi[pos] >= h)){
for(int j = 1; j <= m && shots > 0; j++){
if(a[pos][j] >= h) a[pos][j]--, shots--;
if(maxi[pos] == -1 || maxi[pos] < a[pos][j]) maxi[pos] = a[pos][j];
}
}else if(side == 'E' && (maxi[pos] == -1 || maxi[pos] >= h)){
for(int j = m; j >= 1 && shots > 0; j--){
if(a[pos][j] >= h) a[pos][j]--, shots--;
if(maxi[pos] == -1 || maxi[pos] < a[pos][j]) maxi[pos] = a[pos][j];
}
}else if(side == 'N' && (maxj[pos] == -1 || maxj[pos] >= h)){
for(int i = 1; i <= n && shots > 0; i++){
if(a[i][pos] >= h) a[i][pos]--, shots--;
if(maxj[pos] == -1 || maxj[pos] < a[i][pos]) maxj[pos] = a[i][pos];
}
}else if(side == 'S' && (maxj[pos] == -1 || maxj[pos] >= h)){
for(int i = n; i >= 1 && shots > 0; i--){
if(a[i][pos] >= h) a[i][pos]--, shots--;
if(maxj[pos] == -1 || maxj[pos] < a[i][pos]) maxj[pos] = a[i][pos];
}
}
}
long long sums[1+n][1+m] = {{0}};
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
sums[i][j] += a[i][j] + sums[i][j-1];
}
}
long long maxx = 0;
for(int j = 1; j <= m; j++){
for(int i = 1; i <= n; i++){
sums[i][j] += sums[i-1][j];
if(i >= p && j >= p) maxx = max(maxx, sums[i][j]-sums[i][j-p]-sums[i-p][j]+sums[i-p][j-p]);
}
}
cout << maxx;
return 0;
}
