#include<bits/stdc++.h>
using namespace std;
int main()
{
	string dir="ENSW";
	vector<int> dx={0,-1,1,0},dy={1,0,0,-1};
	int n,m,k;
	cin>>k>>n>>m;
	if(k%2)
	{
		cout<<"impossible"<<endl;
		return 0;
	}
	string s;
	cin>>s;
	for(int i=0;i<k;i++)
	{
		if(s[i]=='B' and s[(i+1)%k]=='B')
		{
			cout<<"impossible"<<endl;
			return 0;
		}
	}
	auto dis=[&](int sx,int sy,int tx,int ty){return abs(sx-tx)+abs(sy-ty);};
	int sx,sy;
	cin>>sx>>sy;
	vector<vector<int>> vis(n+5,vector<int>(m+5));
	vector<pair<int,int>> seq;
	auto turn=[&](int pos)
	{
		int pre=(pos+k-1)%k,nxt=(pos+1)%k;
		return seq[pre].first!=seq[nxt].first and seq[pre].second!=seq[nxt].second;
	};
	auto pcheck=[&](int pos)
	{
		if(s[pos]=='W')return not turn(pos);
		if(s[pos]=='B')return turn(pos);
		return true;
	};
	auto check=[&](int pos)
	{
		if(s[pos]=='W')
		{
			return (turn((pos+k-1)%k) or turn((pos+1)%k)) and not turn(pos);
		}
		if(s[pos]=='B')
		{
			return not turn((pos+k-1)%k) and not turn ((pos+1)%k) and turn(pos);
		}
		return true;
	};
	auto inbounds=[&](int x,int y){return 1<=x and x<=n and 1<=y and y<=m;};
	string ans;
	function<void(int,int,int)> dfs=[&](int x,int y,int now)
	{
//		cerr<<"dfs "<<x<<' '<<y<<' '<<now<<endl;
		if(now==k)
		{
			//check k-2,k-1,0,1
			if(not check(k-2))return;
			if(not check(k-1))return;
			if(not check(0))return;
			if(not check(1))return;
			if(sx==x and sy==y)
			{
				cout<<ans<<endl;
				exit(0);
			}
			return;
		}
		vis[x][y]=1;
		seq.emplace_back(x,y);
//		for(auto [tx,ty]:seq)cerr<<"("<<tx<<','<<ty<<") ";
//		cerr<<endl;
		int ok=1;
		if(now>=2)
		{
			if(not pcheck(now-1))
				ok=0;
		}
		if(now>=4)
		{
			//check now-2
			if(not check(now-2))
			{
//				cerr<<"bad pearl "<<now-2<<endl;
				ok=0;
			}
		}
		if(ok)
		{
			for(int d=0;d<4;d++)
			{
				if(not inbounds(x+dx[d],y+dy[d]))continue;
				if(now==k-1 and x+dx[d]==sx and y+dy[d]==sy)
				{
					ans.push_back(dir[d]);
					dfs(x+dx[d],y+dy[d],now+1);
					ans.pop_back();
				}
				if(not vis[x+dx[d]][y+dy[d]] and dis(x+dx[d],y+dy[d],sx,sy)<=k-now-1)
				{
					ans.push_back(dir[d]);
					dfs(x+dx[d],y+dy[d],now+1);
					ans.pop_back();
				}
			}
		}
		vis[x][y]=0;
		seq.pop_back();
	};
	dfs(sx,sy,0);
	cout<<"impossible"<<endl;
	
	return 0;
}