#include <bits/stdc++.h>
#define ll long long
#define Db double
#define For(x,y,z) for(int x=y;x<=z;x++)
#define Rep(x,y,z) for(int x=y;x>=z;x--)
#define pii pair<int,int>
#define fi first
#define sc second
using namespace std;
inline char GC() {
    static char buf[1 << 20], *S = buf, *T = S;
    return S == T && (T = (S = buf) + fread(buf, 1, 1 << 20, stdin), S == T) ? EOF : *S++;
}
inline ll Getint() {
    char ch = GC();
    ll x = 0, fh = 1;

    while (ch < '0' || ch > '9') {
        if (ch == '-')
            fh = -1;

        ch = GC();
    }

    while (ch >= '0' && ch <= '9') {
        (x *= 10) += ch ^ 48;
        ch = GC();
    }

    return x * fh;
}
const int N = 805;
int lm, n, m, mx[16];
char s[N * N];
inline int id(int x, int y) {
    return (x - 1) * m + y;
}
inline int GD(char c) {
    return c == 'N' ? 0 : (c == 'E' ? 1 : (c == 'S' ? 2 : 3));
}

int prt[N * N], lim[N][N];
inline int Getfa(int x) {
    return prt[x] == x ? x : prt[x] = Getfa(prt[x]);
}
inline bool Merge(int x, int y) {
    x = Getfa(x);
    y = Getfa(y);

    if (x == y)
        return 0;

    prt[x] = y;
    return 1;
}

int tim, vis[N][N];
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
inline bool In(int x, int y) {
    return 1 <= x && x <= n && 1 <= y && y <= m;
}
inline bool Chk(int x, int y) {
    int s = 0;
    For(i, 0, 3) {
        pii t = pii(x + dx[i], y + dy[i]);

        if (!In(t.fi, t.sc))
            continue;

        s |= (vis[t.fi][t.sc] == tim) << i;
    }
    return lim[x][y] <= mx[s];
}

pii q[N * N];

inline pii Spfa(int x, int y) {
    if (lim[x][y] == (1 << 30))
        return pii(-1, 1 << 30);

    vis[x][y] = ++tim;
    int ht = 1, rt = 1;
    q[rt] = pii(x, y);
    int p = Getfa(id(x, y)), nx, sz = 0;

    while (ht <= rt) {
        pii u = q[ht++];
        sz++;
        For(i, 0, 3) {
            pii t = pii(u.fi + dx[i], u.sc + dy[i]);

            if (!In(t.fi, t.sc))
                continue;

            if (vis[t.fi][t.sc] != tim && Chk(t.fi, t.sc)) {
                vis[t.fi][t.sc] = tim;
                q[++rt] = t;

                if ((nx = Getfa(id(t.fi, t.sc))) != p)
                    return pii(nx, 1 << 30);
            }
        }
    }

    return pii(-1, sz);
}
int main() {
    int x, y, z;
    lm = Getint();
    n = Getint();
    m = Getint();
    For(i, 1, lm) {
        s[i] = GC();

        while (s[i] < 'A' || s[i] > 'Z')
            s[i] = GC();
    }
    For(i, 1, lm)s[lm + i] = s[i];
    For(i, 1, n)For(j, 1, m) {
        lim[i][j] = Getint();

        if (lim[i][j] == 0)
            lim[i][j] = 1 << 30;
    }
    For(T, 0, 15) {
        int l = 0;
        For(i, 1, 2 * lm) {
            if ((T >> GD(s[i])) & 1)
                l++, mx[T] = max(mx[T], l);
            else
                l = 0;
        }

        if (mx[T] == 2 * lm)
            mx[T] = 2e5;
    }
    For(i, 1, n)For(j, 1, m)prt[id(i, j)] = id(i, j);

    while (true) {
        vector<pii>nd;
        vector<int>vd;
        For(i, 1, n)For(j, 1, m) {
            y = Getfa(x = id(i, j));

            if (x == y)
                nd.push_back(pii(i, j));
        }
        vd.resize(nd.size());
        For(e, 0, int(nd.size()) - 1) {
            vd[e] = Spfa(nd[e].fi, nd[e].sc).fi;
        }
        For(e, 0, int(nd.size()) - 1) {
            if (vd[e] == -1)
                continue;

            Merge(id(nd[e].fi, nd[e].sc), vd[e]);
        }
        int sm = 0;
        For(i, 1, n)For(j, 1, m) {
            y = Getfa(x = id(i, j));

            if (x == y)
                sm++;
        }

        if (sm == nd.size())
            break;
    }

    pii ans = pii(1 << 30, 0);
    For(i, 1, n)For(j, 1, m) {
        y = Getfa(x = id(i, j));

        if (x == y) {
            z = Spfa(i, j).sc;

            if (z < ans.fi)
                ans = pii(z, z);
            else if (z == ans.fi)
                ans.sc += z;
        }
    }
    cout << ans.fi << '\n' << ans.sc << '\n';
    return 0;
}