#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std; using namespace placeholders;

typedef long long LL;
typedef unsigned long long ULL;
typedef vector< int > VI;
typedef vector< vector< int > > VVI;
typedef vector< string > VS;
typedef stringstream SS;
typedef pair< int, int > PII;
typedef vector< pair< int, int > > VPII;
#define VT( T ) vector< T >
#define VVT( T ) vector< vector< T > >
#define LIM( T ) numeric_limits< T >

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }
template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; };
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };

#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &e : c )
#define ALL( c ) ( c ).begin(), ( c ).end()
#define AALL( a, t ) ( t* )a, ( t* )a + sizeof( a ) / sizeof( t )
#define DRANGE( c, p ) ( c ).begin(), ( c ).begin() + p, ( c ).end()

#define SZ( v ) ( (int)( v ).size() )
#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

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

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

	for ( LL H, W, L; cin >> H >> W >> L && ( H | W | L ); )
	{
		VS board( H );
		cin >> board;

		int y = 0, x = 0, d = 0;
		REP( i, H )
		{
			REP( j, W )
			{
				if ( isupper( board[i][j] ) )
				{
					y = i;
					x = j;
					d = dirs.find( board[i][j] );
					board[i][j] = '.';
				}
			}
		}

		VT( VVI ) visited( H, VVI( W, VI( 4, -1 ) ) );

		for ( int i = 0; i < L; ++i )
		{
			if ( visited[y][x][d] != -1 && ( L - i ) % ( i - visited[y][x][d] ) == 0 )
			{
				break;
			}

			visited[y][x][d] = i;

			while ( true )
			{
				const int ny = y + dy[d];
				const int nx = x + dx[d];

				if ( 0 <= ny && ny < H && 0 <= nx && nx < W && board[ ny ][ nx ] == '.' )
				{
					break;
				}
				else
				{
					++d %= 4;
				}
			}

			y += dy[d];
			x += dx[d];
		}

		cout << y + 1 << ' ' << x + 1 << ' ' << dirs[d] << endl;
	}

	return 0;
}