#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 200005;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) { 
        re(first); re(rest...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { 
        pr(first); pr(rest...); 
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) { 
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { 
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

template<class T> T invGeneral(T a, T b) {
    a %= b; if (a == 0) return b == 1 ? 0 : -1;
    T x = invGeneral(b,a); 
    return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}

template<class T> struct modular {
    T val; 
    explicit operator T() const { return val; }
    modular() { val = 0; }
    modular(const ll& v) { 
        val = (-MOD <= v && v <= MOD) ? v : v % MOD;
        if (val < 0) val += MOD;
    }
    
    friend ostream& operator<<(ostream& os, const modular& a) { return os << a.val; }
    friend bool operator==(const modular& a, const modular& b) { return a.val == b.val; }
    friend bool operator!=(const modular& a, const modular& b) { return !(a == b); }

    modular operator-() const { return modular(-val); }
    modular& operator+=(const modular& m) { if ((val += m.val) >= MOD) val -= MOD; return *this; }
    modular& operator-=(const modular& m) { if ((val -= m.val) < 0) val += MOD; return *this; }
    modular& operator*=(const modular& m) { val = (ll)val*m.val%MOD; return *this; }
    friend modular pow(modular a, ll p) {
        modular ans = 1; for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend modular inv(const modular& a) { 
        auto i = invGeneral(a.val,MOD); assert(i != -1);
        return i;
    } // equivalent to return exp(b,MOD-2) if MOD is prime
    modular& operator/=(const modular& m) { return (*this) *= inv(m); }
    
    friend modular operator+(modular a, const modular& b) { return a += b; }
    friend modular operator-(modular a, const modular& b) { return a -= b; }
    friend modular operator*(modular a, const modular& b) { return a *= b; }
    
    friend modular operator/(modular a, const modular& b) { return a /= b; }
};

typedef modular<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

int M,R,C,mx[1<<4];
pi ans = {MOD,MOD};
vector<vi> U;
int comp[800][800], par[800*800];
vpi rcomp[800*800];

string dir = "ENWS";
int xd[4] = {0,1,0,-1}, yd[4] = {-1,0,1,0};
string D;

int hsh(int a, int b) { return C*a+b; }

bool sat(char a, int b) {
	int pos = dir.find(a);
	return b&(1<<pos);
}

int con(int x) {
	int ret = 0;
	for (int i = 0; i < sz(D); ) {
		if (!sat(D[i],x)) i++;
		else {
			int I = i;
			while (i < sz(D) && sat(D[i],x)) i ++;
			if (I == 0 && i == sz(D)) return MOD;
			ckmax(ret,i-I);
		}
	}
	return ret;
}

void init() {
    setIO(); re(M,R,C,D); D += D;
    F0R(i,1<<4) {
    	mx[i] = con(i);
    	// ps(i,mx[i]);
    }
    U.rsz(R);
    F0R(i,R*C) par[i] = -1;
    F0R(i,R) {
    	U[i].rsz(C); re(U[i]);
    	F0R(j,C) if (U[i][j]) {
    		int x = C*i+j; comp[i][j] = x+MOD;
    		rcomp[x].pb({i,j}); par[x] = x;
    	} else comp[i][j] = -MOD;
    }
}

int get(int x) {
	if (x == -1) return x;
	if (par[x] == x) return x;
	return par[x] = get(par[x]);
}

int cnt = 0;
int vis[800][800];
pi st[800][800];

bool valid(pi A) {
	if (A.f < 0 || A.f >= R || A.s < 0 || A.s >= C) return 0;
	if (U[A.f][A.s] == 0) return 0;
	return 1;
}

int getComp(pi A) {
	int t = comp[A.f][A.s]; if (t >= MOD) t -= MOD;
	return t;
}

pi bfs(pi x) {
	assert(comp[x.f][x.s] >= MOD);
	queue<pi> q; 
	vis[x.f][x.s] = ++cnt; q.push(x);
	int num = 1;
	while (sz(q)) {
		auto a = q.front(); q.pop();
		F0R(i,4) {
			pi A = {a.f+xd[i],a.s+yd[i]}; 
			if (!valid(A) || vis[A.f][A.s] == cnt) continue;
			if (st[A.f][A.s].f != cnt) st[A.f][A.s] = {cnt,0};
			st[A.f][A.s].s |= 1<<i;
			if (mx[st[A.f][A.s].s] >= U[A.f][A.s]) {
				num ++; vis[A.f][A.s] = cnt; q.push(A);
				if (getComp(A) != comp[x.f][x.s]-MOD) return {getComp(A),num};
			}
		}
	}
	return {MOD,num};
}

void join(int a, int b) {
	a = get(a), b = get(b); 
	if (a == b) return;
	assert(a != -1);
	if (b == -1) {
		trav(t,rcomp[a]) comp[t.f][t.s] = -1; 
		par[a] = b; rcomp[a].clear();
		return;
	}
	if (sz(rcomp[a]) > sz(rcomp[b])) {
		pi A = rcomp[a].back(); comp[A.f][A.s] = a;
		trav(t,rcomp[b]) {
			comp[t.f][t.s] = a;
			rcomp[a].pb(t);
		}
		A = rcomp[a].back(); comp[A.f][A.s] = a+MOD;
		par[b] = a; rcomp[b].clear();
	} else {
		int ind = sz(rcomp[b])-1;
		trav(t,rcomp[a]) {
			comp[t.f][t.s] = b;
			rcomp[b].pb(t);
		}
		swap(rcomp[b][ind],rcomp[b].back());
		par[a] = b; rcomp[a].clear();
	}
}

int main() {
	init();
    F0R(i,100) {
    	vpi ed;
    	F0R(i,R) F0R(j,C) if (comp[i][j] >= MOD) { // special cell
    		int c = comp[i][j]-MOD;
    		pi x = bfs({i,j});
    		if (x.f == MOD) { // no new component reached, update answer
    			if (ans.f > x.s) ans = {x.s,0};
    			if (ans.f == x.s) ans.s += x.s;
    			ed.pb({c,-1});
    		} else if (x.f == -1) {
    			ed.pb({c,-1});
    		} else ed.pb({c,x.f});
    	}
    	if (!sz(ed)) break;
    	trav(t,ed) {
    		join(t.f,t.s); // merge components
    	}
    }
    ps(ans.f,ans.s);
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?), set tle
    * do smth instead of nothing and stay organized
*/