#include<bits/stdc++.h>

#define vc vector
#define pb emplace_back
#define pii pair<int, int>
#define mkp make_pair
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define lep(i, a, b) for(int i = (a); i >= (b); --i)

using namespace std;

inline int read() {
	int x = 0, w = 0; char ch = getchar(); while(!isdigit(ch)) w |= (ch == '-'), ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); return w ? -x : x; 
}

const int N = 7e5 + 5, M = 805, inf = 1e9;
const int dx[5] = {-1, 0, 1, 0, 0}, dy[5] = {0, 1, 0, -1, 0};

int R, C, m, dir[N], a[M][M], row[16], buc[N];
int id[M][M], trans[N], dfn[N], low[N], ins[N], stk[N], topf, idx, cnt;
char str[N << 1];
vc<int> G[N];

inline bool ok(int x, int y) { return x > 0 && x <= R && y > 0 && y <= C && a[x][y]; }

inline void add(int x, int y, int z) {
	int s = 0;
	rep(i, 0, 3) {
		int u = x + dx[i], v = y + dy[i];
		if(ok(u, v) && id[u][v] == z) s |= 1 << i;
	}
	if(row[s] >= a[x][y]) G[z].pb(id[x][y]); 
}

inline void tarjan(int x) {
	dfn[x] = low[x] = ++idx; stk[++topf] = x; ins[x] = 1;
	for(auto y: G[x]) 
		if(!dfn[y]) tarjan(y), low[x] = min(low[x], low[y]);
		else if(ins[y]) low[x] = min(low[x], dfn[y]);
	if(dfn[x] == low[x]) {
		int z; ++cnt;
		do { z = stk[topf--]; ins[z] = 0; trans[z] = cnt; } while(x != z);
	}
}

inline bool solve() {
	int node = cnt; cnt = 0;
	rep(i, 0, node) dfn[i] = ins[i] = 0, G[i].clear();
	
	rep(i, 1, R) rep(j, 1, C) if(a[i][j]) rep(k, 0, 3) {
		int x = i + dx[k], y = j + dy[k];
		if(ok(x, y) && id[x][y] != id[i][j]) add(x, y, id[i][j]);
	}
	
	rep(i, 1, node) if(!dfn[i]) tarjan(i);
	
	rep(i, 1, R) rep(j, 1, C) if(a[i][j]) id[i][j] = trans[id[i][j]];
	
	return cnt < node;
}

signed main() {
	m = read(); R = read(); C = read(); 
	
	scanf("%s", str + 1); 
	rep(i, 1, m) {
		if(str[i] == 'N') dir[i] = 0;
		else if(str[i] == 'E') dir[i] = 1;
		else if(str[i] == 'S') dir[i] = 2;
		else dir[i] = 3;
		dir[i + m] = dir[i];
	}
	rep(s, 1, 15) {
		int sum = 0;
		rep(i, 1, 2 * m) 
			if((s >> dir[i]) & 1) ++sum;
			else row[s] = max(row[s], sum), sum = 0;
		row[s] = max(row[s], sum);
		row[s] = row[s] == 2 * m ? inf : row[s];
	}
	
	rep(i, 1, R) rep(j, 1, C) {
		a[i][j] = read();
		if(a[i][j]) id[i][j] = ++cnt;
	}
	
	while(solve());
	
	rep(i, 1, R) rep(j, 1, C) ++buc[id[i][j]];
	
	int ans = inf, tot = 0;
	rep(i, 1, cnt) if(!G[i].size()) {
		if(buc[i] < ans) tot = ans = buc[i];
		else if(buc[i] == ans) tot += buc[i];
	}
	cout << ans << endl << tot << endl;
	return 0;
}