//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <queue>

using namespace std;

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

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

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int H, W; LL L;
  while(cin>>H>>W>>L,H){
	vector<string> vs(H);
	REP(i,H) cin >> vs[i];
	int sx, sy, sd;
	REP(y,H) REP(x,W)
	  if(vs[y][x] != '.' && vs[y][x] != '#'){
		sx = x, sy = y;
		switch(vs[y][x]){
		case 'N': sd = 0; break;
		case 'E': sd = 1; break;
		case 'S': sd = 2; break;
		case 'W': sd = 3; break;
		}
	  }

	bool vis[100][100][4];
	fill((bool*)vis, (bool*)vis+100*100*4, false);
	int tx = sx, ty = sy, td = sd;
	while(!vis[ty][tx][td]){
	  vis[ty][tx][td] = true;
	  int ttx = tx + dx[td], tty = ty + dy[td];
	  if(ttx < 0 || W <= ttx || tty < 0 || H <= tty || vs[tty][ttx] == '#'){
		td = (td + 1) % 4;
	  }
	  else{
		tx = ttx, ty = tty;
	  }
	}

	int lx = tx, ly = ty, ld = td;
	LL cnt = 0;
	while(vis[ty][tx][td]){
	  vis[ty][tx][td] = false;
	  int ttx = tx + dx[td], tty = ty + dy[td];
	  if(ttx < 0 || W <= ttx || tty < 0 || H <= tty || vs[tty][ttx] == '#'){
		td = (td + 1) % 4;
	  }
	  else{
		tx = ttx, ty = tty, ++cnt;
	  }
	}

	tx = sx, ty = sy, td = sd;
	while(L && (lx != tx || ly != ty || ld != td)){
	  int ttx = tx + dx[td], tty = ty + dy[td];
	  if(ttx < 0 || W <= ttx || tty < 0 || H <= tty || vs[tty][ttx] == '#'){
		td = (td + 1) % 4;
	  }
	  else{
		tx = ttx, ty = tty, --L;
	  }
	}

	if(L > cnt)
	  L %= cnt, L+=cnt;

	while(L){
	  int ttx = tx + dx[td], tty = ty + dy[td];
	  if(ttx < 0 || W <= ttx || tty < 0 || H <= tty || vs[tty][ttx] == '#'){
		td = (td + 1) % 4;
	  }
	  else{
		tx = ttx, ty = tty, --L;
	  }
	}
	char ch;
	switch(td){
	case 0: ch = 'N'; break;
	case 1: ch = 'E'; break;
	case 2: ch = 'S'; break;
	case 3: ch = 'W'; break;
	}
	cout << ty+1 << " " << tx+1 << " " << ch << endl;
  }
  
  return 0;
}