#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<bitset>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
int n,m,q,k;
map<int,int>mp[200010];
int px[200010];
int py[200010];
int tot;
int mx1,mx2,mn1,mn2;
int fx,fy;
int size;
vector<int>t1[200010];
vector<int>t2[200010];
vector<int>t3[200010];
vector<int>t4[200010];
char ch[200010];
int a,b,c,d;
ll ans;
struct lty
{int cnt;int root[200010];int ls[4000010];int rs[4000010];int sum[4000010];void updata(int &rt,int pre,int l,int r,int k){rt=++cnt;ls[rt]=ls[pre];rs[rt]=rs[pre];sum[rt]=sum[pre]+1;if(l==r){return ;}int mid=(l+r)>>1;if(k<=mid){updata(ls[rt],ls[pre],l,mid,k);}else{updata(rs[rt],rs[pre],mid+1,r,k);}}int query(int x,int y,int l,int r,int L,int R){if(!y){return 0;}if(L<=l&&r<=R){return sum[y]-sum[x];}int mid=(l+r)>>1;int res=0;if(L<=mid){res+=query(ls[x],ls[y],l,mid,L,R);}if(R>mid){res+=query(rs[x],rs[y],mid+1,r,L,R);}return res;}
}tr1,tr2,tr3,tr4;
int main()
{scanf("%d%d%d%d",&n,&m,&k,&q);scanf("%d%d",&fx,&fy);tot++;px[tot]=fx,py[tot]=fy;mx1=mn1=fx,mx2=mn2=fy;mp[fx][fy]=1;if(k){scanf("%s",ch+1);}for(int i=1;i<=k;i++){tot++;if(ch[i]=='N'){fx--;}else if(ch[i]=='S'){fx++;}else if(ch[i]=='E'){fy++;}else{fy--;}px[tot]=fx,py[tot]=fy;mx1=max(mx1,fx);mn1=min(mn1,fx);mx2=max(mx2,fy);mn2=min(mn2,fy);mp[fx][fy]=1;}for(int i=1;i<=tot;i++){int x=px[i],y=py[i];if(mp[x][y]==2){continue;}mp[x][y]=2;t1[x].push_back(y);if(y>1)t2[x].push_back(y);if(y<m&&!mp[x][y+1])t2[x].push_back(y+1);if(x>1)t3[x].push_back(y);if(x<n&&!mp[x+1][y])t3[x+1].push_back(y);if(x>1&&y>1)t4[x].push_back(y);if(x<n&&y<m&&!mp[x+1][y+1])t4[x+1].push_back(y+1);if(x<n&&y>1&&!mp[x][y-1]&&!mp[x+1][y])t4[x+1].push_back(y);if(x>1&&y<m&&!mp[x-1][y]&&!mp[x-1][y+1]&&!mp[x][y+1])t4[x].push_back(y+1);}for(int i=1;i<=n;i++){tr1.root[i]=tr1.root[i-1];tr2.root[i]=tr2.root[i-1];tr3.root[i]=tr3.root[i-1];tr4.root[i]=tr4.root[i-1];size=t1[i].size();for(int j=0;j<size;j++){tr1.updata(tr1.root[i],tr1.root[i],1,m,t1[i][j]);}size=t2[i].size();for(int j=0;j<size;j++){tr2.updata(tr2.root[i],tr2.root[i],1,m,t2[i][j]);}size=t3[i].size();for(int j=0;j<size;j++){tr3.updata(tr3.root[i],tr3.root[i],1,m,t3[i][j]);}size=t4[i].size();for(int j=0;j<size;j++){tr4.updata(tr4.root[i],tr4.root[i],1,m,t4[i][j]);}}while(q--){scanf("%d%d%d%d",&a,&b,&c,&d);ans=0;if(a<mn1&&c>mx1&&b<mn2&&d>mx2){ans++;}ans+=1ll*(d-b)*(c-a)-tr1.query(tr1.root[a-1],tr1.root[c],1,m,b,d);ans-=1ll*(d-b-1)*(c-a)-tr2.query(tr2.root[a-1],tr2.root[c],1,m,b+1,d);ans-=1ll*(d-b)*(c-a-1)-tr3.query(tr3.root[a],tr3.root[c],1,m,b,d);ans+=1ll*(d-b-1)*(c-a-1)-tr4.query(tr4.root[a],tr4.root[c],1,m,b+1,d);printf("%lld\n",ans);}return 0;
}