#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

#define dump(a) (cerr << (#a) << " = " << (a) << endl)

template<class T> inline void chmax(T& a, const T& b) { if(b > a) a = b; }
template<class T> inline void chmin(T& a, const T& b) { if(b < a) a = b; }

template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
	os << '(' << p.first << ", " << p.second << ')';
	return os;
}

template<class Tuple, unsigned Index>
void print_tuple(ostream& os, const Tuple& t) {}

template<class Tuple, unsigned Index, class Type, class... Types>
void print_tuple(ostream& os, const Tuple& t) {
	if(Index > 0) os << ", ";
	os << get<Index>(t);
	print_tuple<Tuple, Index + 1, Types...>(os, t);
}

template<class... Types>
ostream& operator<<(ostream& os, const tuple<Types...>& t) {
	os << '(';
	print_tuple<tuple<Types...>, 0, Types...>(os, t);
	return os << ')';
}

template<class Iterator>
ostream& dump_range(ostream&, Iterator, const Iterator&);

template<typename T>
ostream& operator<<(ostream& os, vector<T> c) {
	return dump_range(os, c.cbegin(), c.cend());
}

template<class Iterator>
ostream& dump_range(ostream& os, Iterator first, const Iterator& last) {
	os << '[';
	for(int i = 0; first != last; ++i, ++first) {
		if(i) os << ", ";
		os << *first;
	}
	return os << ']';
}


constexpr int NUMBER_OF_DIRECTIONS = 4;
const string direction = "ESWN";
constexpr int dx[NUMBER_OF_DIRECTIONS] = {1, 0, -1, 0};
constexpr int dy[NUMBER_OF_DIRECTIONS] = {0, 1, 0, -1};

struct state {
	int x, y, d;
	state(int x = 0, int y = 0, int d = 0):x(x), y(y), d(d){}
};

ostream& operator<<(ostream& os, const state& s) {
	return os << s.y + 1 << " " << s.x + 1 << " " << direction[s.d];
}

const int MAX_SIZE = 100;
string field[MAX_SIZE];
int h, w;
long long l;

int label[MAX_SIZE][MAX_SIZE][NUMBER_OF_DIRECTIONS];
state states[MAX_SIZE * MAX_SIZE * NUMBER_OF_DIRECTIONS];

inline bool out(int x, int y) {
	return x < 0 || x >= w || y < 0 || y >= h;
}

inline bool verify(int x, int y) {
	return !out(x, y) && field[y][x] != '#';
}

state solve(int x, int y, int d) {
	memset(label, -1, sizeof(label));
	for(int i = 0; i < l; ++i) {
		if(label[y][x][d] != -1) {
			const long long T = i - label[y][x][d];
			const long long rest = l - i;
			return states[label[y][x][d] + rest % T];
		}

		label[y][x][d] = i;
		states[i] = state(x, y, d);

		while(!verify(x + dx[d], y + dy[d])) d = (d + 1) % NUMBER_OF_DIRECTIONS;
		x += dx[d];
		y += dy[d];
	}

	return state(x, y, d);
}

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

	while(cin >> h >> w >> l && h) {
		for(int i = 0; i < h; ++i) {
			cin >> field[i];
		}

		state start;
		for(int i = 0; i < h; ++i) {
			for(int j = 0; j < w; ++j) {
				if(isalpha(field[i][j])) {
					start.x = j;
					start.y = i;
					start.d = direction.find(field[i][j]);
					goto end;
				}
			}
		}

	end:;

		cout << solve(start.x, start.y, start.d) << endl;
	}

	return EXIT_SUCCESS;
}

Measured memory_bytes: 1876