#include <iostream>
#include <algorithm>
#include <queue>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXR = 810, MAXN = 64e4 + 10, MAXM = 1e5 + 10;
const int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};

int M, n, m, rs[MAXR][MAXR];
char dir[MAXM << 1];

inline int Tr(char ch) {return (ch == 'N' ? 0 : ch == 'E' ? 1 : ch == 'S' ? 2 : 3);}
int mxlen[18];
inline int C(int i, int j) {return (i - 1) * m + j;}
inline pair <int, int> C(int x) {return make_pair((x + m - 1) / m, (x - 1) % m + 1);}

int fa[MAXN];
int Find(int k) {return k == fa[k] ? k : fa[k] = Find(fa[k]);}
inline void Union(int u, int v)
{
    u = Find(u), v = Find(v);
    if (u != v) fa[u] = v;
}

int cnd[MAXN], top, mch[MAXN];
int vis[MAXN], idx;
queue < pair <int, int> > q;
inline bool Check(int x, int y)
{
    if (x < 1 || x > n || y < 1 || y > m) return 0;
    int s = 0;
    for (int i = 0; i < 4; i++)
    {
        int xx = x + dx[i], yy = y + dy[i];
        if (xx < 1 || xx > n || yy < 1 || yy > m) continue;
        // cout << xx << " " << yy << " " << vis[C(xx, yy)] << "\n";
        if (vis[C(xx, yy)] == idx) s ^= (1 << i);
    }
    // cout << "Check " << x << " " << y << " " << s << " " << idx << "\n";
    return mxlen[s] >= rs[x][y];
}
inline pair <int, int> BFS(int st)
{
    auto cur = C(st); int x = cur.first, y = cur.second;
    int cop = Find(st), sz = 0;
    if (rs[x][y] == 2e9) return make_pair(-1, 2e9);
    while (!q.empty()) q.pop();
    q.push(cur), vis[C(x, y)] = ++idx;
    while (!q.empty())
    {
        cur = q.front(), x = cur.first, y = cur.second, q.pop();
        // cout << x << " " << y << " " << idx << "\n";
        sz++;
        for (int i = 0; i < 4; i++)
        {
            int xx = x + dx[i], yy = y + dy[i];
            if (vis[C(xx, yy)] == idx) continue;
            if (!Check(xx, yy)) continue;
            if (Find(C(xx, yy)) != cop) return make_pair(C(xx, yy), 0);
            q.push(make_pair(xx, yy)), vis[C(xx, yy)] = idx;
        }
    }
    return make_pair(-1, sz);
}

int main()
{
    // freopen("tmp.in", "r", stdin);
    // freopen("tmp.out", "w", stdout);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(M), Read(n), Read(m);
    Read(dir + 1);
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
        {
            Read(rs[i][j]);
            if (!rs[i][j]) rs[i][j] = 2e9;
        }
    for (int i = 1; i <= M; i++) dir[i + M] = dir[i];
    for (int s = 1; s < 16; s++)
    {
        int cnt = 0;
        for (int i = 1; i <= 2 * M; i++)
            if (s & (1 << Tr(dir[i]))) cnt++, mxlen[s] = max(mxlen[s], cnt);
            else cnt = 0;
        if (mxlen[s] == 2 * M) mxlen[s] = 1e9;
    }
    for (int i = 1; i <= n * m; i++) fa[i] = i;
    while (1)
    {
        top = 0;
        for (int i = 1; i <= n * m; i++)
            if (fa[i] == i) cnd[++top] = i;
        for (int i = 1; i <= top; i++) mch[cnd[i]] = BFS(cnd[i]).first;//, cout << cnd[i] << " " << mch[cnd[i]] << "\n";
        bool flag = 0;
        for (int i = 1; i <= top; i++)
            if (~mch[cnd[i]]) Union(cnd[i], mch[cnd[i]]), flag = 1;
        if (!flag) break;
    }
    int mn = 1e9, ans = 0;
    for (int i = 1; i <= n * m; i++)
        if (fa[i] == i)
        {
            auto cur = BFS(i);
            if (cur.second < mn) mn = ans = cur.second;
            else if (cur.second == mn) ans += cur.second;
        }
    Write(mn, '\n'), Write(ans, '\n');
    return 0;
}