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

const int  N = (int)1e6 + 12, MOD = 998244353, maxn = 805;

const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int n, r, c, u[maxn][maxn], mx = 0, e[N];
string s, t;
vector<int> P[4];
vector<vector<int>> w[N];

int conv(int x, int y) {
    return (x - 1) * c + y;
}
bool bl[N];
int lst_a = -1;
void prec() {
    cin >> s;
    for(int i = 1; i <= r; i++) {
        for(int j = 1; j <= c; j++) {
            cin >> u[i][j];
            if(!u[i][j]) {
                u[i][j] = (int)1e9;
                bl[conv(i, j)] = 1;
            }
        }
    }
    for(int i = 0; i < n; i++) {
        if(s[i] == 'N') {
            e[i] = 0;
        } else if(s[i] == 'S') {
            e[i] = 2;
        } else if(s[i] == 'E') {
            e[i] = 3;
        } else {
            e[i] = 1;
        }
        P[e[i]].push_back(i);
    }
    for(int i = 1; i < (1 << 4); i++) {
        vector<int> f;
        for(int j = 0; j < 4; j++) {
            if(!((i >> j) & 1)) {
                for(int j : P[j]) {
                    f.push_back(j);
                }
            }
        }
        int mx = 0;
        if(f.empty()) { 
            mx = (int)1e6;
        } else {
            sort(f.begin(), f.end());
            mx = f[0] + (n - 1 - f.back());
            for(int l = 1; l < (int)f.size(); l++) {
                mx = max(mx, f[l] - f[l - 1] - 1);
            }
        }
        for(int x = 1; x <= r; x++) {
            for(int y = 1; y <= c; y++) {
                if(u[x][y] > mx) continue;
                bool ok = 1;
                vector<int> nv;
                for(int j = 0; j < 4; j++) {
                    if((i >> j) & 1) {
                        int kx = x - dx[j], ky = y - dy[j];
                        if(kx >= 1 && kx <= r && ky >= 1 && ky <= c) {
                            nv.push_back(conv(kx, ky));
                        } else {
                            ok = 0;
                        }
                    }
                }
                if(!ok) continue;
                w[conv(x, y)].push_back(nv);
            }
        }
    }
    n = r * c;
}
bool is[N];
int p[N], pr[N], bfc[N];
vector<vector<int>> g;
int us[N], timer, m, sn[N];
bool del[N];
void make(int tc) {
    timer++;
    for(int i = 1; i <= n; i++) {
        bfc[i] = 0;
        sn[i]= 0;
    }
    int aa = 0;
    for(int i = 1; i <= n; i++) {
        if(bl[i]) continue;
        for(auto ve : w[i]) {
            int lst = -1;
            for(int j : ve) {
                if(lst == -1) {
                    lst = p[j];
                } else {
                    if(lst != p[j]) {
                        lst = -2;
                    }
                }
            }
            if(lst == -2) continue;
            if(lst == p[i]) continue;
            if(is[lst] && pr[p[i]] != lst) {
                if(us[lst] != timer) {
                    us[lst] = timer;
                    g[lst].push_back(p[i]);
                }
            } else {
                g[lst].push_back(p[i]);
                sn[lst] = 1;
            }
        }
    }
    for(int i = 1; i <= m; i++) {
        if(!is[i]) continue;
        if(us[i] == timer || sn[i]) {
            aa++;
        }
    }
    assert(lst_a == -1 || aa <= (lst_a + 1) / 2);
    lst_a = aa;

    vector<vector<int>> gt(n + 1);
    vector<pair<int, int>> ed;
    for(int i = 1; i <= m; i++) {
        for(int to : g[i]) {
            gt[to].push_back(i);
            ed.emplace_back(i, to);
        }
    }
    vector<int> ord;
    vector<bool> vis(m + 1, 0);
    function<void(int)> dfs = [&](int v){
        vis[v] = 1;
        for(int to : g[v]) {
            if(!vis[to]) {
                dfs(to);
            }
        }
        ord.push_back(v);
    };
    function<void(int, int)> dfs1 = [&](int v, int cl) {
        bfc[v] = cl;
        for(int to : gt[v]) {
            if(!bfc[to]) {
                dfs1(to, cl);
            }
        }  
    };
    for(int i = 1; i <= m; i++) {
        if(!vis[i]) {
            dfs(i);
        }
    }
    reverse(ord.begin(), ord.end());
    assert((int)ord.size() == m);
    int t = 0;
    for(int i : ord) {
        if(!bfc[i]) {
            dfs1(i, ++t);
        }
    }
    m = t;
    vector<vector<int>> G(n + 1), GT(n + 1);
    for(int i = 1; i <= n; i++) {
        p[i] = bfc[p[i]];
    }
    for(auto [x, y] : ed) {
        if(bfc[x] != bfc[y]) {
            G[bfc[x]].push_back(bfc[y]);
            GT[bfc[y]].push_back(bfc[x]);
        }
    }
    g = G;
    for(int i = 1; i <= m; i++) {
        pr[i] = 0;
    }
    function<void(int, int)> go = [&](int v, int val) {
        pr[v] = val;
        for(int to : GT[v]) {
            if(!pr[to]) {
                go(to, val);
            }
        }
    };
    for(int i = 1; i <= m; i++) {
        if(G[i].empty()) {
            go(i, i);
            is[i] = 1;
        } else {
            is[i] = 0;
        }
    }
}
int col[N];
bool bl1[N];
void test() {
    cin >> n >> r >> c;
    prec();
    m = n;
    g.resize(n + 1);
    for(int i = 1; i <= n; i++) {
        pr[i] = p[i] = i;
        is[i] = 1;
    }
    if(r <800 || c < 800) for(int i = 0; i < 3; i++) make(1 + i);
    else make(0);
    for(int i = 1; i <= n; i++) {
        if(!is[p[i]]) continue;
        col[p[i]]++;
        if(bl[i]) {
            bl1[p[i]] = 1;
        }
    }
    vector<int> r;
    for(int i = 1; i <= m; i++) {
        if(is[i] && !bl1[i]) {
            r.push_back(col[i]);
        }
    }
    int res = 0;
    sort(r.begin(), r.end());
    for(int i = 0; i < (int)r.size() && r[i] == r[0]; i++) {
        res += r[0];
    }
    cout << r[0] << '\n' << res << '\n';
}

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

    int t = 1;
    // cin >> t;

    while(t--) {
        test();
    }
}