//code by Nobody.Emissary
#include<bits/stdc++.h>

#define fi first
#define se second
#define vc vector
#define mk make_pair
#define pb push_back
#define PI pair<int,int>

using namespace std;

const int inf = 1e9;
const int MAXN = 802;
const int rx[]={-1,1,0,0}, ry[]={0,0,-1,1};

namespace IO{
	inline int read(){
		int X=0, W=0; char ch=getchar();
		while(!isdigit(ch)) W|=ch=='-', ch=getchar();
		while(isdigit(ch)) X=(X<<1)+(X<<3)+(ch^48), ch=getchar();
		return W?-X:X;
	}
	inline void write(int x){
		if(x<0) x=-x, putchar('-');
		if(x>9) write(x/10);
		putchar(x%10+'0');
	}
	inline void sprint(int x){write(x), putchar(32);}
	inline void eprint(int x){write(x), putchar(10);}
}using namespace IO;

int edgecnt, v[MAXN*MAXN], topf, tot;
int u[MAXN][MAXN], minn, ans, X[MAXN*MAXN], Y[MAXN*MAXN], colcnt;
int m, r, c, id[MAXN*MAXN], stk[MAXN*MAXN], dfn[MAXN*MAXN], low[MAXN*MAXN], du[MAXN*MAXN];
int head[MAXN*MAXN], ne[MAXN*MAXN<<4], to[MAXN*MAXN<<4], maxn[MAXN], bel[MAXN*MAXN], bl[MAXN*MAXN], cnt;

char s[MAXN*MAXN];

vc<int> node[MAXN*MAXN], Col[MAXN*MAXN], tmp[MAXN*MAXN];

bool ins[MAXN*MAXN], vis[MAXN*MAXN], Vis[MAXN*MAXN];

PI E[MAXN*MAXN*16];

inline int ID(int x, int y){return (x-1)*c+y;}

inline void add(int x, int y){++cnt;to[cnt]=y;ne[cnt]=head[x];head[x]=cnt;}

inline int solve(int x){
	for(int i=1;i<=m;++i) v[i]=((1<<id[s[i]]) & x)!=0, v[i+m]=v[i];
	int tot=0, now=0;
	for(int i=1;i<=m<<1;++i){
		if(v[i]==0) now=max(now,tot), tot=0;
		else tot++;
	}
	now=max(now,tot);
	if(now==2*m) now=1e9;
	return now;
}

inline void tarjan(int x){
	stk[++topf]=x; low[x]=dfn[x]=++tot; ins[x]=1;
	for(int i=head[x];i;i=ne[i]){
		if(dfn[to[i]]){
			if(ins[to[i]]) low[x]=min(low[x],dfn[to[i]]);
		}
		else tarjan(to[i]), low[x]=min(low[x],low[to[i]]);
	}
	if(dfn[x]==low[x]){
		++colcnt; stk[topf+1]=0;
		Col[colcnt].clear(); Col[colcnt].shrink_to_fit();
		while(stk[topf+1]!=x){
			int t=stk[topf];
			bl[t]=colcnt; Col[colcnt].pb(t);
			ins[t]=0; --topf;
		}
	}
	return ;
}



int main(){
	tot=0;
	scanf("%d%d%d%s",&m,&r,&c,s+1);
	id['N']=0, id['S']=1, id['W']=2, id['E']=3;
	for(int i=0;i<16;++i) maxn[i]=solve(i);
	for(int i=1;i<=r;++i)
		for(int j=1;j<=c;++j){
			u[i][j]=read();
			if(u[i][j]) node[++tot].pb(ID(i,j));
			X[ID(i,j)]=i, Y[ID(i,j)]=j, bel[ID(i,j)]=tot;
		}
	int nowcnt=tot, www=tot, las=tot+2, lasc=-1;
	for(int i=1;i<=22;++i){
		if(nowcnt==las && cnt==lasc) break;
		tot=0; edgecnt=0; colcnt=0; topf=0;
		for(int j=1;j<=nowcnt;++j) dfn[j]=0;
		for(int j=1;j<=nowcnt;++j) if(dfn[j]==0) tarjan(j);
		for(int j=1;j<=colcnt;++j){
			tmp[j].clear(); tmp[j].shrink_to_fit();
			for(auto k:Col[j])
				for(auto o:node[k]) tmp[j].pb(o), bel[o]=j;
		}
		for(int j=1;j<=colcnt;++j) node[j]=tmp[j];
		for(int j=1;j<=colcnt;++j){
			du[j]=0; int cur=edgecnt;
			for(auto k:node[j]) vis[k]=1;
			for(auto k:node[j]){
				int x=X[k], y=Y[k], ax, ay;
				for(int o=0;o<4;++o){
					ax=x+rx[o], ay=y+ry[o];
					if(ax>=1 && ax<=r && ay>=1 && ay<=c){
						if(vis[ID(ax,ay)] || Vis[bel[ID(ax,ay)]]) continue;
						int tx=ax, ty=ay, state=0;
						for(int p=0;p<4;++p){
							if(tx+rx[p]>=1 && ty+ry[p]>=1 && tx+rx[p]<=r && ty+ry[p]<=c){
								if(!vis[ID(tx+rx[p],ty+ry[p])]) continue;
								state|=1<<p;
							}
						}
						if(u[tx][ty] && maxn[state]>=u[tx][ty] && j!=bel[ID(tx,ty)] && !Vis[bel[ID(tx,ty)]]) Vis[bel[ID(tx,ty)]]=1, E[++edgecnt]=mk(j,bel[ID(tx,ty)]);
					}
				}
			}
			for(int j=cur+1;j<=edgecnt;++j) Vis[E[j].se]=0;
			for(auto k:node[j]) vis[k]=0;
		}
		lasc=cnt;
		for(int j=1;j<=colcnt;++j) head[j]=0; cnt=0;
		for(int j=1;j<=edgecnt;++j) add(E[j].fi,E[j].se), du[E[j].fi]++;
		las=nowcnt; nowcnt=colcnt;
	}
	minn=1e9;
	for(int i=1;i<=nowcnt;++i){
		if(du[i]==0){
			if(node[i].size()<minn) minn=node[i].size(), ans=node[i].size();
			else if(node[i].size()==minn) ans+=node[i].size();
		}
	}
	printf("%d\n%d\n",minn,ans);
	return 0;
}