#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1<<29;

typedef long long ll;

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

int dis[100][100][4];

struct P {
  int y,x,d;
};
P p[100*100*4];

int main() {
  int h,w;
  ll l;
  char dir[4] = {'N','E','S','W'};
  
  while(cin>>h>>w>>l, h||w||l) {
    char ba[h][w];
    int x, y, d;
    REP(i,h) {
      REP(j,w) {
        cin >> ba[i][j];
        if (ba[i][j] != '.' && ba[i][j] != '#') {
          y = i;
          x = j;
          char c = ba[i][j];
          if (c=='N') d = 0;
          else if (c=='E') d = 1;
          else if (c=='S') d = 2;
          else if (c=='W') d = 3;
        }
      }
    }
    memset(dis, 0, sizeof(dis));
    memset(p, 0, sizeof(p));
    int cnt = 0;
    P ans;
    bool f = 0;
    while(1) {
      // if (f)
      //   printf("%d %d,%d %d\n",cnt, x,y,d);
      if (cnt == l) {
        ans = (P){y,x,d};
        break;
      }
      if (f&&dis[y][x][d]) {
        ll hoge = cnt - dis[y][x][d];
        l -= dis[y][x][d];
        //cout << l << endl;
        l %= hoge;
        //cout << l << " " << hoge << " " << l + dis[y][x][d] <<endl;
        ans = p[l + dis[y][x][d]];
        break;
      }
      if (f) {
        p[cnt] = (P){y,x,d};
        dis[y][x][d] = cnt;
      }
      f = 0;
      
      int yy = y+dy[d];
      int xx = x+dx[d];
      if (yy<0||yy>=h||xx<0||xx>=w||ba[yy][xx]=='#') {
        d = (d+1)%4;
      } else {
        x = xx;
        y = yy;
        cnt++;
        f = 1;
      }
    }
    // if (ans.y==34&&ans.x==37) {
    //   cout << "adslkfumsdlkfu" << endl << "................." << endl;
    //   cout << h << " " << w << " " <<  l << endl;
    // }
    printf("%d %d %c\n", ans.y+1, ans.x+1, dir[ans.d]);
  }
}