// Problem: #3155. 「JOI Open 2019」病毒实验
// Contest: LibreOJ
// URL: https://loj.ac/p/3155
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

// 私は猫です

#include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define inf 1000000000
#define infll 1000000000000000000ll
#define pii pair<int,int>
#define rep(i,a,b,c) for(int i=(a);i<=(b);i+=(c))
#define per(i,a,b,c) for(int i=(a);i>=(b);i-=(c))
#define F(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define dF(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define cmh(sjy) while(sjy--)
#define lowbit(x) (x&(-x))
#define HH printf("\n")
#define eb emplace_back
#define poly vector<int>
#define SZ(x) ((int)x.size())
using namespace std;
template<typename T>inline void chkmax(T &x,const T &y){ x=std::max(x,y); }
template<typename T>inline void chkmin(T &x,const T &y){ x=std::min(x,y); }
const int mod=998244353,maxn=1000005,NR=805;
int k,n,m,a[NR][NR],fa[maxn];
inline int id(int x,int y){ return (x-1)*m+y; }
inline pii decode(int u){ return mkp((u-1)/m+1,((u-1)%m)+1); }
inline bool in_matrix(int x,int y){ return (x>0&&x<=n&&y>0&&y<=m); }
inline int find(int x){ return fa[x]==x?x:fa[x]=find(fa[x]); }
string virus_wind; 
int q[maxn],st[NR][NR],nxt[maxn],to[NR][NR];
const int dx[5]={1,-1,0,0,0},dy[5]={0,0,1,-1,0};
void solve(){
	cin>>k>>n>>m>>virus_wind,virus_wind+=virus_wind;
	vector<int>cur(16,0),T(16,0);
	for(char &c:virus_wind){
		int d=0;
		for(;c!="NSWE"[d];++d);
		F(s,1,15)if((s>>d)&1)++cur[s]; else chkmax(T[s],cur[s]),cur[s]=0;
	}
	F(s,1,15)chkmax(T[s],cur[s]);
	F(i,1,n)F(j,1,m)cin>>a[i][j],chkmin(a[i][j],k);
	F(i,1,n*m)fa[i]=i;
	F(i,1,n)F(j,1,m)if(!a[i][j])a[i][j]=inf,fa[id(i,j)]=0;
	int ans=inf,cnt=0;
	for(;;){
		vector<int>vec;
		F(u,1,n*m)if(find(u)==u)vec.push_back(u);
		if(vec.empty())break;
		for(int u:vec){
			int qL=1,qR=0; auto [x,y]=decode(u);
			q[++qR]=u,st[x][y]=-1,nxt[u]=u;
			while(qL<=qR){
				auto [x,y]=decode(q[qL++]);
				F(d,0,3){
					const int nx=x+dx[d],ny=y+dy[d],v=id(nx,ny);
					if(!in_matrix(nx,ny))continue;
					if(st[nx][ny]==-1||T[st[nx][ny]|=(1<<d)]<a[nx][ny])continue;
					st[nx][ny]=-1;
					if(find(v)==u)q[++qR]=v;
					else{ nxt[u]=v; break; }
				}
				if(nxt[u]^u)break;
			}
			if(nxt[u]==u){
				if(qR<ans)ans=qR,cnt=1;
				else if(qR==ans)++cnt;
				fa[u]=0;
			}
			F(i,1,qR){
				auto [x,y]=decode(q[i]);
				F(d,0,4)st[x+dx[d]][y+dy[d]]=0;
			}
		}
		for(int u:vec)fa[find(u)]=find(nxt[u]);
	}
	cout<<ans<<'\n'<<(ans*cnt);
}
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int zsy=1;
	F(____,1,zsy)solve();
}