#include <bits/stdc++.h>

using namespace std;

#define int            long long int
#define F              first
#define S              second
#define pb             push_back
#define si             set <int>
#define vi             vector <int>
#define pii            pair <int, int>
#define vpi            vector <pii>
#define vpp            vector <pair<int, pii>>
#define mii            map <int, int>
#define mpi            map <pii, int>
#define spi            set <pii>
#define endl           "\n"
#define sz(x)          ((int) x.size())
#define all(p)         p.begin(), p.end()
#define double         long double
#define que_max        priority_queue <int>
#define que_min        priority_queue <int, vi, greater<int>>
#define bug(...)       __f (#__VA_ARGS__, __VA_ARGS__)
#define print(a)       for(auto x : a) cout << x << " "; cout << endl
#define print1(a)      for(auto x : a) cout << x.F << " " << x.S << endl
#define print2(a,x,y)  for(int i = x; i < y; i++) cout<< a[i]<< " "; cout << endl

inline int power(int a, int b)
{
  int x = 1;
  while (b)
  {
    if (b & 1) x *= a;
    a *= a;
    b >>= 1;
  }
  return x;
}

template <typename Arg1>
void __f (const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << endl; }
template <typename Arg1, typename... Args>
void __f (const char* names, Arg1&& arg1, Args&&... args)
{
  const char* comma = strchr (names + 1, ',');
  cout.write (names, comma - names) << " : " << arg1 << " | "; __f (comma + 1, args...);
}

const int N = 200005;

struct Node{
    
    pair<int,int>N,S,W,E;

    Node(){
        N=S=E=W={0,0};
    }

    Node(int x,int y){
        N={x-1,y};
        S={x+1,y};
        E={x,y+1};
        W={x,y-1};
    }
};

void solve(int cc) {

int n,r,c;
cin>>n>>r>>c;
int sr,sc;
cin>>sr>>sc;
string s;cin>>s;
map<pair<int,int>,Node>m;
Node curr= Node(sr,sc);
m[{sr,sc}]=curr;
for(int i=0; i<s.length(); i++){
        
        if(m.find({sr,sc})==m.end()){
            m[{sr,sc}]=Node(sr,sc);
        }
        auto n=m[{sr,sc}].N;
        auto ss=m[{sr,sc}].S;
        auto w=m[{sr,sc}].W;
        auto e=m[{sr,sc}].E;

        if(m.find(n)==m.end())m[n]= Node(n.first,n.second);
        if(m.find(ss)==m.end())m[ss]= Node(ss.first,ss.second);
        if(m.find(e)==m.end())m[e]= Node(e.first,e.second);
        if(m.find(w)==m.end())m[w]= Node(w.first,w.second);

        m[n].S=ss;
        m[ss].N=n;
        m[e].W=w;
        m[w].E=e;
        if(s[i]=='E')sc=e.second;
        else if(s[i]=='W')sc=w.second;
        else if(s[i]=='S')sr=ss.first;
        else sr=n.first;


    }
cout<<"Case #"<<cc<<": "<<sr<<" "<<sc<<endl;


}

int32_t main()
{
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);


  clock_t z = clock();

  int t = 1;
  cin >> t;
for(int i=1; i<=t; i++)solve(i);



  return 0;
}