#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 = 1e6 + 12;

int dx[] = {0, 0, -1, 1};
int dy[] = {-1, 1, 0, 0};
bool used[901][901];
int u[901][901];
int val[300], mx[10];
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;
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin >> u[i][j];
        }
    }
    int mx = 1e9, cnt = 0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(!u[i][j]) continue;
            int l = j, r = j;
            while(1){
                if(l > 1 && u[i][l-1] <= val[1] && u[i][l-1]) l--;
                else if(r < m && u[i][r+1] <= val[2] && u[i][r+1]) r++;
                else break;
            }
            if(mx > r - l + 1) {
                mx = r - l + 1;
                cnt = 0;
            }
            if(mx == r - l + 1) cnt++;
        }
    }
    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();
    }
}