#include <bits/stdc++.h>
using namespace std;

template<class T>
bool chmax(T& a, const T& b) {
    if (a < b) { a = b; return true; }
    return false;
}
template<class T>
bool chmin(T& a, const T& b) {
    if (b < a) { a = b; return true; }
    return false;
}

// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

// std::vector Declaration and Initialization
template<typename T>
vector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }
template<typename T, typename U, typename... Ts>
auto make_vector(size_t a, U b, Ts... ts) {
    return vector<decltype(make_vector<T>(b,ts...))>(a, make_vector<T>(b, ts...));
}

// std::vector Input
template<typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto &e : v) is >> e;
    return is;
}

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::array Debug
template<typename T, size_t n>
ostream& operator<<(ostream& os, const array<T, n>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::deque Debug
template<typename T>
ostream& operator<<(ostream& os, const deque<T>& d) {
    os << "[";
    bool a = 1;
    for (auto e : d) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

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

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
    os << "{";
    bool a = 1;
    for (auto e : mp) {
        os << (a ? "" : " ");
        os << e.first << ":" << e.second;
        a = 0;
    }
    os << "}";
    return os;
}

// std::tuple Debug
template<int N, class Tuple>
void out(ostream& os, const Tuple& t){}
template<int N, class Tuple, class H, class ...Ts>
void out(ostream& os, const Tuple& t) {
    if (N) os << " ";
    os << get<N>(t);
    out<N+1,Tuple,Ts...>(os, t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
    os << "(";
    out<0,tuple<Ts...>,Ts...>(os, t);
    os << ")";
    return os;
}

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

// Weighted edge
template<typename T>
struct edge {
    int src, to;
    T cost;

    edge() {}
    edge(int to, T cost) : src(-1), to(to), cost(cost) {}
    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    friend ostream& operator<<(ostream& os, const edge& e) {
        return os << "(" << e.src << "->" << e.to << ":" << e.cost << ")";
    }
};

using LL = int64_t;

#define fs first
#define sc second

const int64_t MOD = 1e9+7;


int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    map<char,int> dir;
    dir['E'] = 0;
    dir['S'] = 1;
    dir['W'] = 2;
    dir['N'] = 3;
    map<int,char> dirmap;
    dirmap[0] = 'E';
    dirmap[1] = 'S';
    dirmap[2] = 'W';
    dirmap[3] = 'N';
    int dx[] = {1, 0, -1, 0},
        dy[] = {0, 1, 0, -1};

    while (true) {
        int H, W; LL L;
        cin >> H >> W >> L;
        if (H == 0) break;

        auto S = make_v<bool>(H, W);
        int si = -1, sj = -1, sd = -1;
        for (int i = 0; i < H; ++i) {
            string s; cin >> s;
            for (int j = 0; j < W; ++j) {
                S[i][j] = s[j] == '#';
                if (s[j] == 'E') si = i, sj = j, sd = dir['E'];
                if (s[j] == 'S') si = i, sj = j, sd = dir['S'];
                if (s[j] == 'W') si = i, sj = j, sd = dir['W'];
                if (s[j] == 'N') si = i, sj = j, sd = dir['N'];
            }
        }
        vector<tuple<int,int,int>> trail;
        map<tuple<int,int,int>,int> trailmap;
        auto tp = make_tuple(si, sj, sd);
        trailmap[tp] = 0;
        trail.push_back(tp);

        int repeat = -1, length = -1;
        for (int k = 1;; ++k) {
            while (true) {
                int x = sj + dx[sd], y = si + dy[sd];
                if (0 <= x and x < W and 0 <= y and y < H and
                        !S[y][x]) {
                    si = y, sj = x;
                    break;
                }
                sd = (sd+1) % 4;
            }

            auto tp = make_tuple(si, sj, sd);
            if (trailmap.count(tp)) {
                repeat = trailmap[tp];
                length = k - repeat;
                break;
            }
            trailmap[tp] = k;
            trail.push_back(tp);

        }

        int i, j, d;
        if (L >= repeat) {
            tie(i, j, d) = trail[repeat + (L - repeat) % length];
        } else {
            tie(i, j, d) = trail[L];
        }
        printf("%d %d %c\n", i+1, j+1, dirmap[d]);
    }

    return 0;
}



Measured memory_bytes: 3572