#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
using namespace std;
inline int read(){
    int x=0,f=1;char ch=getchar();
    while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
    while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
    return x*f;
}
const int MK = 1e5+5, MN = 805;
const char dir[5]="NSWE";
const int Dx[4]={-1,1,0,0},Dy[4]={0,0,-1,1};
int K,n,m,S[MK<<1],A[MN][MN];
int bx[MN][MN],by[MN][MN],tx[MN][MN],ty[MN][MN],C[MN][MN];
int ans,cnt,tot,L,R,Qx[MN*MN],Qy[MN*MN],T[16];
char s[MN];
void reset(){rep(i,1,n)rep(j,1,m)tx[i][j]=ty[i][j]=0;}
bool out(int x,int y){return x<1||x>n||y<1||y>m;}
bool chk(int x,int y){
    int sta=0;
    rep(i,0,3){
        int nx=x+Dx[i],ny=y+Dy[i];
        if(out(nx,ny))continue;
        if(C[nx][ny]==tot)sta|=1<<i;
    }
    return A[x][y]<=T[sta];
}
bool bfs(int sx,int sy){
    if(A[sx][sy]>100000){
        tx[sx][sy]=sx,ty[sx][sy]=sy;
        R=n*m+1;
        return 0;
    }
	C[sx][sy]=++tot;
    L=R=1,Qx[1]=sx,Qy[1]=sy;
	while (L <= R) {
		int x=Qx[L],y=Qy[L];
        ++L;
        rep(i,0,3){
            int nx=x+Dx[i],ny=y+Dy[i];
            //判断可行性
            if(out(nx,ny))continue;
            if(C[nx][ny]==tot)continue;
            if(!chk(nx,ny))continue;
            int Bx=bx[nx][ny],By=by[nx][ny];
            if(Bx!=sx||By!=sy){//合并
                int Tx=tx[Bx][By],Ty=ty[Bx][By];
                if(Tx){
                    tx[sx][sy]=Tx,ty[sx][sy]=Ty;
                    return 1;
                }
                tx[sx][sy]=tx[Bx][By]=Bx;
                ty[sx][sy]=ty[Bx][By]=By;
                return 1;
            }
            C[nx][ny]=tot;
            ++R;
            Qx[R]=nx,Qy[R]=ny;
        }
    }
    tx[sx][sy]=sx,ty[sx][sy]=sy;
    return 0;
}
int main(){
    K=read(),n=read(),m=read();
    scanf("%s",s+1);
    rep(i,1,K)rep(j,0,3)
        if(s[i]==dir[j])S[i]=S[K+i]=j;
    rep(i,1,n)rep(j,1,m){
        A[i][j]=read();
        if(!A[i][j])A[i][j]=100001;
    }
    rep(sta,1,15){
        int len=0,mx=0;
        rep(i,1,2*K){
            if(sta>>S[i]&1)mx=max(mx,++len);
            else len=0;
        }
        if(mx==2*K)mx=100000;
        T[sta]=mx;
    }
    rep(i,1,n)rep(j,1,m)bx[i][j]=i,by[i][j]=j;
    while(1){
        bool ok=0;
        reset();
        rep(i,1,n)rep(j,1,m){
            int x=bx[i][j],y=by[i][j];
            if(tx[x][y])continue;
            ok|=bfs(x,y);
        }
        rep(i,1,n)rep(j,1,m){
            int x=bx[i][j],y=by[i][j];
            bx[i][j]=tx[x][y];
            by[i][j]=ty[x][y];
        }
        if(!ok)break;
    }
    reset();
    ans=n*m+1;
    rep(i,1,n)rep(j,1,m){
        int x=bx[i][j],y=by[i][j];
        if(tx[x][y])continue;
        bfs(x,y);
        if(ans>R)ans=cnt=R;
        else if(ans==R)cnt+=R;
    }
    printf("%d\n%d\n",ans,cnt);
    return 0;
}