#include<bits/stdc++.h>
using namespace std;
const int MAXN = 65;
const int dx[4] = {0, -1, 1,  0};
const int dy[4] = {1,  0, 0, -1};
const char ch[4] = {'E', 'N', 'S', 'W'};
int tot, n, m, sx, sy;
char s[MAXN], ret[MAXN];
int vis[MAXN][MAXN];
void work(int depth, int x, int y, int flg) { // flg: 0 -> no limit, 1 -> straight, 2 -> turn
	int steps = tot + 1 - depth;
	if (steps < abs(x - sx) + abs(y - sy)) return;
	if (depth > tot) {
		if (flg == 1 && ret[tot] != ret[1]) return;
		if (flg == 2 && ret[tot] == ret[1]) return;
		
		if (s[1] == 'B' && ret[tot] != ret[tot - 1]) return;
		if (s[1] == 'W' && ret[tot] == ret[tot - 1]) return;

		if (s[2] == 'B' && ret[tot] != ret[1]) return;
		if (s[1] == 'W' && !(ret[2] != ret[1] || ret[tot] != ret[tot - 1])) return;
		if (s[2] == 'W' && !(ret[3] != ret[2] || ret[1] != ret[tot])) return;
		
		printf("%s\n", ret + 1);
		exit(0);
		return;
	}
	if (x < 1 || x > n || y < 1 || y > m || vis[x][y]) return;
	vis[x][y] = depth;
	if (depth == 1) {
		for (int i = 0; i <= 3; i++) {
			ret[depth] = ch[i];
			work(depth + 1, x + dx[i], y + dy[i], 0);
		}
		vis[x][y] = 0;
		return;
	}
	if (s[depth] == 'B') {
		if (flg == 1 || (depth >= 3 && ret[depth - 2] != ret[depth - 1])) {
			vis[x][y] = 0;
			return;
		}
		for (int i = 0; i <= 3; i++) {
			if (ch[i] == ret[depth - 1]) continue;
			ret[depth] = ch[i];
			work(depth + 1, x + dx[i], y + dy[i], 1);
		}
		vis[x][y] = 0;
		return;
	}
	if (s[depth] == 'W') {
		if (flg == 2) {
			vis[x][y] = 0;
			return;
		}
		for (int i = 0; i <= 3; i++) {
			if (ch[i] != ret[depth - 1]) continue;
			ret[depth] = ch[i];
			work(depth + 1, x + dx[i], y + dy[i], 2 * (depth >= 3 && ret[depth - 1] == ret[depth - 2]));
		}
		vis[x][y] = 0;
		return;
	}
	if (s[depth] == '.') {
		if (flg == 0) {
			for (int i = 0; i <= 3; i++) {
				ret[depth] = ch[i];
				work(depth + 1, x + dx[i], y + dy[i], 0);
			}
		} else if (flg == 1) {
			for (int i = 0; i <= 3; i++) {
				if (ch[i] != ret[depth - 1]) continue;
				ret[depth] = ch[i];
				work(depth + 1, x + dx[i], y + dy[i], 0);
			}
		} else {
			for (int i = 0; i <= 3; i++) {
				if (ch[i] == ret[depth - 1]) continue;
				ret[depth] = ch[i];
				work(depth + 1, x + dx[i], y + dy[i], 0);
			}
		}
		vis[x][y] = 0;
		return;
	}
}
int main() {
	scanf("%d%d%d", &tot, &n, &m);
	scanf("\n%s", s + 1);
	scanf("%d%d", &sx, &sy);
	work(1, sx, sy, 0);
	puts("impossible");
	return 0;
}