#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
//#define int long long
using namespace std;
const int mod=1e9+7,mxn=1e6+5,Mxn=1e8,inf=1e9,minf=-1e9,lg=30;
int n,m,r,k,p;
void setIO(string name){
ios_base::sync_with_stdio(0); cin.tie(0);
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
struct seg{
vector<int>v;
void init(int n){v.resize(4*n+4,minf);}
void upd(int l,int r,int pos,int val,int up){
if(l==r)return void(v[pos]=val);
int mid=l+(r-l)/2;
if(up<=mid)upd(l,mid,pos*2,val,up);
else upd(mid+1,r,pos*2+1,val,up);
v[pos]=max(v[pos*2],v[pos*2+1]);
}
void update(int pos,int val,int n){
upd(1,n,1,val,pos);
}
int qry1(int l,int r,int ql,int qr,int h,int pos){
int mid=l+(r-l)/2;
if(v[pos]<h)return inf;
if(l==r)return r;
if(v[pos*2]>=h)return qry1(l,mid,ql,qr,h,pos*2);
else return qry1(mid+1,r,ql,qr,h,pos*2+1);
}
int qry2(int l,int r,int ql,int qr,int h,int pos){
int mid=l+(r-l)/2;
if(v[pos]<h)return inf;
if(l==r)return r;
if(v[pos*2+1]>=h)return qry2(mid+1,r,ql,qr,h,pos*2+1);
else return qry2(l,mid,ql,qr,h,pos*2);
}
}t[2][mxn+10];
int get1(int d,int h,int n,int p,int last){
return t[d][p].qry1(1,n,last+1,n,h,1);
}
int get2(int d,int h,int n,int p,int last){
return t[d][p].qry2(1,n,1,last-1,h,1);
}
int32_t main(){
fastio
cin>>n>>m>>r>>k>>p;
vector<vector<int>>grid(n+1,vector<int>(m+1,0));
for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)cin>>grid[i][j];
for(int i=1;i<=n;i++){
t[0][i].init(m);
for(int j=1;j<=m;j++)t[0][i].update(j,grid[i][j],m);
}
for(int j=1;j<=m;j++){
t[1][j].init(n);
for(int i=1;i<=n;i++)t[1][j].update(i,grid[i][j],n);
}
int d=0,sz=0,cnt,last,x,y;
bool yes=false;
while(k--){
char g;cin>>g;
int p,h;cin>>p>>h;
if(g=='W'||g=='E')d=0,sz=m;
else d=1,sz=n;
if(g=='W'||g=='N')yes=true,last=0;
else yes=false,last=sz+1;
cnt=r;
while(cnt--){
last=((yes)?get1(d,h,sz,p,last):get2(d,h,sz,p,last));
if(last==inf||last==minf)break;
x=p,y=last;
if(d)swap(x,y);
grid[x][y]--;
t[0][x].update(y,grid[x][y],m);
t[1][y].update(x,grid[x][y],n);
}
}
for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)grid[i][j]+=grid[i][j-1]+grid[i-1][j]-grid[i-1][j-1];
int ans=0;
for(int i=p;i<=n;i++)for(int j=p;j<=m;j++)ans=max(ans,grid[i][j]-grid[i-p][j]-grid[i][j-p]+grid[i-p][j-p]);
cout<<ans;
}
