//#include "rainbow.h"
#include <bits/stdc++.h>
#define ll int
#define str string
#define ins insert
#define ld long double
#define pb push_back
#define pf push_front
#define pof pop_front()
#define pob pop_back()
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define vll vector<ll>
#define arr array
#define pll vector<pair<ll,ll>>
using namespace std;
template<class S,class T>
bool chmin(S &a,const T &b) {
return a>b?(a=b)==b:false;
}
template<class S,class T>
bool chmax(S &a,const T &b) {
return a<b?(a=b)==b:false;
}
const ll inf=1e18;
const ll mod=1e9+7;
const ll N=2e5+5;
const ld eps=1e-9;
bool vis[55][N];
bool f[55][N];
ll l,r,u,d;
ll xd[4]={-1,1,0,0},yd[4]={0,0,-1,1};
bool ok(ll x,ll y){
return !vis[x][y] && !f[x][y] && x>=u && x<=d && y>=l && y<=r;
}
void bfs(ll x,ll y){
ll i;
vis[x][y]=1;
for(i=0;i<4;i++){
ll nx=x+xd[i],ny=y+yd[i];
if(ok(nx,ny))bfs(nx,ny);
}
}
void init(int r, int c, int sr, int sc, int m, char *s) {
ll i,j;
ll x=sr,y=sc;
f[x][y]=1;
for(i=0;i<m;i++){
if(s[i]=='N')x--;
if(s[i]=='S')x++;
if(s[i]=='W')y--;
if(s[i]=='E')y++;
f[x][y]=1;
}
}
int colour(int ar, int ac, int br, int bc) {
u=ar,l=ac,d=br,r=bc;
ll c=0,i,j;
for(i=u;i<=d;i++){
for(j=l;j<=r;j++){
vis[i][j]=0;
}
}
for(i=u;i<=d;i++){
for(j=l;j<=r;j++){
if(vis[i][j] || f[i][j]) continue;
bfs(i,j);
c++;
}
}
return c;
}
