#include <cstdio>
#include <cstring>
#include <string>
using namespace std;

typedef long long LL;

int h, w;
LL L;
int visit[102][102][4];
int log[41000];
char c[102][102];

int main(){
	const string dirstr = "NESW";
	int dy[] = {-1, 0, 1, 0};
	int dx[] = {0, 1, 0, -1};

	while(scanf("%d%d%lld", &h, &w, &L), h){
		memset(visit, -1, sizeof visit);
		memset(c, '#', sizeof c);
		for(int i = 1; i <= h; ++i){
			scanf("%s", c[i] + 1);
			c[i][w + 1] = '#';
		}

		int y, x, d;
		for(int i = 1; i <= h; ++i)
		for(int j = 1; j <= w; ++j){
			if(c[i][j] != '.' && c[i][j] != '#'){
				y = i;
				x = j;
				d = dirstr.find(c[i][j]);
				c[i][j] = '.';
				break;
			}
		}

		for(LL t = 0; ;){
			int ny = y + dy[d], nx = x + dx[d];
			if(c[ny][nx] != '#'){
				++t;
				log[t] = (ny << 10) | (nx << 2) | d;
				y = ny;
				x = nx;

				if(t == L){
					break;
				}

				int p = visit[y][x][d];
				if(p < 0){
					visit[y][x][d] = t;
				}
				else{
					LL dif = t - p;
					LL rem = (L - t) % dif;
					int q = log[p + rem];
					y = q >> 10;
					x = (q >> 2) & 0xff;
					d = q & 3;
					break;
				}
			}
			else{
				d = (d + 1) & 3;
			}
		}
		
		printf("%d %d %c\n", y, x, dirstr[d]);
	}
}