#include <bits/stdc++.h>
using namespace std;

int n, m;
int r, c;
bool grid[50][50];
string ans;
string s;

pair<int,int> dirs[4] {{-1,0},{0,1},{1,0},{0,-1}};
string NESW = "NESW";

void solve(int rr, int cc, int i, int d, bool forward, bool corner, bool was_corner) {
        if (min(rr,cc) < 0 or rr >= n or cc >= m) return;
        if (i and s[i] == 'B' and was_corner) return;

        if ((unsigned)i == s.size()) {
                if (r != rr or c != cc) return;
                if (s.front() == 'B' and NESW[d] == ans[0]) return;
                if (s.front() == 'B' and was_corner) return;
                if (s.front() == 'W' and NESW[d] != ans[0]) return;
                if (s.front() == 'W' and NESW[d] == ans[1] and NESW[d] == ans[ans.size()-2]) return;
                cout << ans << '\n';
                exit(0);
        }

        if (grid[rr][cc]) return;
        grid[rr][cc] = true;
        // cout << rr << ' ' << cc << ' ' << i << endl;

        forward |= s[i] == 'W';
        corner |= s[i] == 'B';
        for (int dd : {1, 0, 2, 3}) {
                if (i and dd == (d+2)%4) continue;
                if (i and forward and dd != d) continue;
                if (i and corner and dd == d) continue;
                auto [dy,dx] = dirs[dd];
                ans += NESW[dd];

                if (s[i] == 'W')
                        solve(rr+dy,cc+dx, i+1, dd, false, !was_corner, false);
                else if (s[i] == 'B')
                        solve(rr+dy,cc+dx, i+1, dd, true, false, true);
                else
                        solve(rr+dy,cc+dx, i+1, dd, false, false, dd!=d);

                ans.pop_back();
        }

        grid[rr][cc] = false;
}

int main() {
        cin.tie(0)->sync_with_stdio(0);

        int k; cin >> k >> n >> m;
        cin >> s;
        cin >> r >> c; r--, c--;
        solve(r,c,0,-1,false,false,true);
        cout << "impossible\n";
}