//JSD
#include<iostream>
#include<map>
#include<stack>
#define ll long long 
#define Maxx (long long)1e9
using namespace std;
void solve(int test){
	string s;
	cin>>s;
	int n=s.length();
	stack<int> st;
	int factor=1;
	map<char, int > m;
	for(int i=0;i<n;i++){		
		if(isdigit(s[i])){
			st.push(int(s[i]-'0'));
			factor*=int(s[i]-'0');
		}
		if(s[i]==')'){
			int x=st.top();
			st.pop();
			factor/=x;			
		}
		if(isalpha(s[i])){
			m[s[i]]+=factor;
		}
	}
	ll x=0,y=0;
	x=(x+m['S'])%Maxx;				
	x=(x-m['N']+Maxx)%Maxx;
	y=(y+m['E'])%Maxx;
	y=(y-m['W']+Maxx)%Maxx;
	cout<<"Case #"<<test<<": "<<y+1<<" "<<x+1<<"\n";	
}
int main(){
	ll t;
	cin>>t;
	int test=1;
	while(t--){
		solve(test);
		test++;
	}
	return 0;
}