#include <bits/stdc++.h>
#define f first
#define s second
#define ent '\n'
//#define int long long

using namespace std;
typedef long long ll;
const int maxn = 640000 + 12;

mt19937 rng(9471893);
int dx[] = {0, 0, -1, 1};
int dy[] = {-1, 1, 0, 0};
int u[901][901], pos[901][901];
bool used[901][901];
map<int, bool> can[maxn];
int val[maxn], p[maxn];
int sz[maxn], w[maxn];
int n, m, k;

void solve(){
    string s;
    cin >> k >> n >> m;
    cin >> s;

    val['W'] = 0;
    val['E'] = 1;
    val['N'] = 2;
    val['S'] = 3;
    while(s.size() <= 1e5){
        s += s;
    }

    for(int mask = 0;mask < 16; mask++){
        for(int i=0;i<s.size();i++){
            if(!(mask & (1 << val[s[i]]))) continue;
            int j = i;
            while(j + 1 < s.size() && (mask & (1 << val[s[j+1]]))){
                j++;
            }
            val[mask] = max(val[mask], j - i + 1);
            i = j;
        }
    }

    vector<pair<int, int>> t;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin >> u[i][j];
            t.push_back({i, j});
        }
    }
    shuffle(t.begin(), t.end(), rng);
    for(int i=1;i<=n*m;i++){
        pos[t[i-1].f][t[i-1].s] = i;
    }

    int mx = 1e9, cnt = 0;
    for(auto [i, j]:t){
        if(!u[i][j]) continue;
        queue<pair<int, int>> q;
        q.push({i, j});
        used[i][j] = 1;
        p[pos[i][j]] = pos[i][j];
        int s = 0, tx = pos[i][j];

        vector<pair<int, int>> ord;

        while(q.size()){
            auto [x, y] = q.front();
            ord.push_back({x, y});
            q.pop();
            s++;

            for(int i=0;i<4;i++){
                int x1 = x + dx[i], y1 = y + dy[i];
                if(!used[x1][y1] && min(x1, y1) > 0 && x1 <= n && y1 <= m && u[x1][y1]){
                    int mask = 0;
                    for(int j=0;j<4;j++){
                        int x2 = x1 + dx[j], y2 = y1 + dy[j];
                        if(used[x2][y2]) mask |= (1 << j);
                    }
                    if(val[mask] >= u[x1][y1]){
                        used[x1][y1] = 1;
                        if(pos[x1][y1] < tx){
                            p[tx] = p[pos[x1][y1]];
                            break;
                        }
                        q.push({x1, y1});
                    }
                }
            }
            if(p[tx] != tx) break;
        }

        if(p[pos[i][j]] == pos[i][j]){
            for(auto [x, y]:ord){
                can[pos[i][j]][pos[x][y]] = 1;
                sz[pos[i][j]]++;
            }
        }
        for(int x=1;x<=n;x++){
            for(int y=1;y<=m;y++){
                used[x][y] = 0;
            }
        }
    }

    reverse(t.begin(), t.end());
    for(auto [i, j]:t){
        if(!u[i][j]) continue;
        if(can[p[pos[i][j]]].count(pos[i][j])) w[p[pos[i][j]]]++;
        if(p[pos[i][j]] == pos[i][j]){
            if(mx > sz[pos[i][j]]){
                mx = sz[pos[i][j]];
                cnt = 0;
            }
            if(mx == sz[pos[i][j]]) cnt += w[p[pos[i][j]]];
        }
    }

    cout << mx << ent << cnt << ent;
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
}