#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <numeric>
#include <cassert>
#include <sys/time.h>
using namespace std;
static const double EPS = 1e-10;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define all(a) a.begin(),a.end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define SS stringstream
#define DBG1(a) rep(_X,sz(a)){printf("%d ",a[_X]);}puts("");
#define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf("%d ",a[_X][_Y]);puts("");}
#define bitcount(b) __builtin_popcount(b)
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)

#define delete(a,n) a.erase(remove(all(a),n),a.end())
template<typename T, typename S> vector<T>& operator<<(vector<T>& a, S b) { a.push_back(b); return a; }
template<typename T> void operator>>(vector<T>& a, int b) {while(b--)if(!a.empty())a.pop_back();}
bool isprime(int n){ if(n<2)return false;  for(int i=2;i*i<=n;i++)if(n%i==0)return false;  return true;} 
ll b_pow(ll x,ll n){return n ? b_pow(x*x,n/2)*(n%2?x:1) : 1ll;}
string itos(int n){stringstream ss;ss << n;return ss.str();}


int W,H;
unsigned long long L;

char c[110][110] = {};

int dx[] = {0,1,0,-1};
int dy[] = {-1,0,1,0};

int to(char c){
	if( c == 'N') return 0;
	if( c == 'E') return 1;
	if( c == 'S') return 2;
	return 3;
}

int main(){
	
	while(cin >> H >> W >> L && W){
		for(int i = 0 ; i < 110 ; i++)
			for(int j = 0 ; j < 110 ; j++)
				c[i][j] = '#';
		
		pair<pair<int,int> ,int> cur;
		for(int i = 1 ; i <= H ; i++){
			for(int j = 1 ; j <= W ; j++){
				cin >> c[i][j];
				if(c[i][j] != '.' && c[i][j] != '#'){
					cur = mp(mp(j,i),to(c[i][j]));
					c[i][j] = '.';
				}
			}
		}
		map< pair<pair<int,int>,int> ,int> con;
		vector< pair<pair<int,int>,int> > res;
		while(1){
			while(1){
				int tx = cur.first.first + dx[cur.second];
				int ty = cur.first.second + dy[cur.second];
				if(c[ty][tx] == '#') cur.second = (cur.second+1)%4;
				else{
					//cur.first = mp(tx,ty);
					break;
				}
			}
			if( con.count(cur) ) break;
			con[cur] = res.size();
			res.push_back(cur);
			int x = res.back().first.first;
			int y = res.back().first.second;
			int d = res.back().second;
			
			int tx = cur.first.first + dx[cur.second];
			int ty = cur.first.second + dy[cur.second];
			cur.first = mp(tx,ty);
			
			//cout << res.size()-1 << " " << y << " " << x << " " << "NESW"[d] << endl;
			
			
		}
		vector< pair<pair<int,int>,int> > two;
		for(int i = con[cur] ; i < res.size() ; i++){
			two.push_back(res[i]);
		}
		L--;
		if(L < res.size()){
			int x = res[L].first.first;
			int y = res[L].first.second;
			int d = res[L].second;
			cur = mp(mp(x,y),d);
		}else{
			L -= res.size();
			int x = two[L%two.size()].first.first;
			int y = two[L%two.size()].first.second;
			int d = two[L%two.size()].second;
			cur = mp(mp(x,y),d);
		}

		while(1){
			while(1){
				int tx = cur.first.first + dx[cur.second];
				int ty = cur.first.second + dy[cur.second];
				if(c[ty][tx] == '#') cur.second = (cur.second+1)%4;
				else{
					//cur.first = mp(tx,ty);
					break;
				}
			}
			int tx = cur.first.first + dx[cur.second];
			int ty = cur.first.second + dy[cur.second];
			cur.first = mp(tx,ty);
			
			//cout << res.size()-1 << " " << y << " " << x << " " << "NESW"[d] << endl;
			break;
			
		}
		
		int x = cur.first.first;
		int y = cur.first.second;
		int d = cur.second;

		cout << y << " " << x << " " << "NESW"[d] << endl;
		//cout << res.size() << endl;
	}
}

Measured memory_bytes: 1068