#include <iostream>
#include <cstdio>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <cctype>
#include <complex>
#include <string>
#include <sstream>
#include <cassert>
using namespace std;

//common
typedef long long ll;

#define BR "\n"
#define ALL(c) (c).begin(),(c).end()
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define EACH(it,o) for(auto it = (o).begin(); it != (o).end(); ++it)
#define IN(l,v,r) ((l)<=(v) && (v)<(r))

//config
//#undef NDEBUG
//#define INF 1<<30
//#define EPS 1e-8
//const ll MOD =100000007;

//debug
#ifdef NDEBUG
#define DUMP(x)
#define DUMPLN(x)
#define DEBUG(x)
#define DEBUGLN(x)
#define LINE()
#define LINELN()
#define CHECK(exp,act)
#define STOP(e)
#else
#define DUMP(x)  cerr << #x << " = " << (x)
#define DUMPLN(x)  DUMP(x) <<endl
#define DEBUG(x) DUMP(x) << LINE() << " " << __FILE__
#define DEBUGLN(x) DEBUG(x)<<endl
#define LINE()    cerr<< " (L" << __LINE__ << ")"
#define LINELN()    LINE()<<endl
#define CHECK(exp,act)  if(exp!=act){DUMPLN(exp);DEBUGLN(act);}
#define STOP(e)  CHECK(e,true);if(!(e)) exit(1);
#endif

template<class T> inline string toString(const vector<T>& x) {
	stringstream ss;
	REP(i,x.size()){
		if(i!=0)ss<<" ";
		ss<< x[i];
	}
	return ss.str();
}

template<class T> inline string toString(const vector<vector<T> >& map) {
	stringstream ss;
	REP(i,map.size()){
		if(i!=0)ss<<BR;
		ss<< toString(map[i]);
	}
	return ss.str();
}
template<class K,class V>  string toString(map<K,V>& x) {
	string res;stringstream ss;
	for(auto& p:x)ss<< p.first<<":" << p.second<<" ";
	return ss.str();
}

//ind -> V から V->ind (注:単射)
template<typename T>
map<T,int> rev(const vector<T>& xs){
	map<T,int> rev;
	REP(i,(int)xs.size())rev.insert(make_pair(xs[i],i));
	return rev;
}

template<typename T,typename V> inline T mod(T v,V MOD){
	return (v%MOD+MOD)%MOD;
}

int H,W;

struct State{
	int y,x,d;
	State(int y,int x,int d):y(y),x(x),d(d){};
};

int enc(int y,int x,int d){
	return (y*W+x)*4+d;
}
char encD(int d){
	if(d==0)return 'E';
	if(d==1)return 'S';
	if(d==2)return 'W';
	if(d==3)return 'N';
	return '_';
}

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

int main(){

	while(true){
		ll L;cin >> H >> W >> L;
		if(H==0)break;
		vector<string> map(H);
		REP(y,H)cin >> map[y];

		int py,px,d;
		REP(y,H)REP(x,W){
			if(map[y][x]=='E'){
				py=y;px=x;d=0;break;
			}
			if(map[y][x]=='S'){
				py=y;px=x;d=1;break;
			}
			if(map[y][x]=='W'){
				py=y;px=x;d=2;break;
			}
			if(map[y][x]=='N'){
				py=y;px=x;d=3;break;
			}
		}
		vector<bool> pass(H*W*4);
		vector<State> ss;
	
		for(int l=0;true;l++){
			if(l==L){
				cout<< (py+1)<<" "<<(px+1)<<" "<<encD(d)<<endl;
				break;
			}
			if(pass[enc(py,px,d)]){//loop check
				int li=-1;
				REP(i,ss.size()){
					if(enc(ss[i].y,ss[i].x,ss[i].d)==enc(py,px,d)){
						li=i;break;
					}
				}
				//L=li+(l-li)*k+r
				int res=(L-li)%(l-li)+li;
				cout<<(ss[res].y+1)<<" "<<(ss[res].x+1)<<" "<<encD(ss[res].d)<<endl;
				break;
			}
			pass[enc(py,px,d)]=true;
			ss.push_back(State(py,px,d));

			//move
			for(int c=0;c<4;c++){
				int nx=px+dx[d],ny=py+dy[d];
				if(!IN(0,nx,W)  || !IN(0,ny,H)){
					d=(d+1+4)%4;continue;
				}
				if(map[ny][nx]=='#'){
					d=(d+1+4)%4;continue;
				}
				px=nx;py=ny;break;
			}
			
		}
	}
	return 0;
}

Measured memory_bytes: 1364