/* name: 1127
 * author: 5ab
 * created at: 2024-01-08
 */
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <tuple>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define ssz(x) (int((x).size()))

auto chmax = [](auto& x, auto y) { if (x < y) x = y; };
auto chmin = [](auto& x, auto y) { if (y < x) x = y; };

using ll = long long;
const int max_n = 800, max_nd = max_n * max_n, max_m = 1e5, drs = 4, sdr = 1 << drs, INF = 1145141919;
const char dr[] = "NESW";

int d[max_n][max_n], c[sdr], st[max_nd], ed[max_nd], par[max_nd], ind = 0, mn = INF, mnc = 0;
int dsu[max_nd * (drs + 1)], siz[max_nd * (drs + 1)], cmk[max_nd * (drs + 1)], nm, m;
vector<int> ad[max_nd], g[max_nd];
vector<pair<int, int>> es;
bool vis[max_nd], bd[max_nd];
char s[max_m + 1];

int fnd(int x) { return x == dsu[x] ? x : (dsu[x] = fnd(dsu[x])); }

int gid(char c) {
	return find(dr, dr + drs, c) - dr;
}
void updmsk(int& mk, int d) {
	// cerr << mk << " " << d << " ";
	mk = (mk && d ? mk | d : 0);
	// cerr << mk << endl;
}
bool dok(int rx, int x, int y) {
	return c[cmk[rx]] >= d[x][y];
}
void push(int rt, int rx, int x, int y)
{
	// cerr << rt << " " << x << " " << y << " " << cmk[rx] << " " << c[cmk[rx]] << endl;
	dsu[rx] = rt;
	ad[rt].push_back(rx);
	if (dok(rx, x, y))
		g[rt].push_back(rx);
}

void dfs(int id)
{
	st[id] = ind++, vis[id] = 1;
	// cerr << id << endl;
	while (!g[id].empty())
	{
		int dst = g[id].back() % nm;
		// cerr << id << " " << dst << endl;
		g[id].pop_back();
		
		// if (fnd(dst) == fnd(id))
		// 	continue;
		es.emplace_back(id, dst);
		if (!vis[dst])
		{
			// cerr << id << " --> " << dst << endl;
			par[dst] = id;
			dfs(dst);
			continue;
		}
		if (!(st[fnd(dst)] <= st[id] && ed[id] <= ed[fnd(dst)]))
			continue;
		// cerr << dst << " " << id << endl;
		while (fnd(dst) != fnd(id))
		{
			int x = fnd(id), y = fnd(par[x]), inv = 0;
			if (ssz(ad[y]) < ssz(ad[x]))
				swap(x, y), inv = 1;
			g[x].clear();
			for (auto p : ad[x])
				dsu[p] = p;
			for (auto p : ad[x])
			{
				// cerr << p << endl;
				int rx = p % nm, cx = rx / m, cy = rx % m;
				bool ok = 1;
				for (int i = 0, tx = rx; i <= drs; i++, tx += nm)
					if (fnd(tx) == y)
					{
						ok = 0;
						bool pok = dok(tx, cx, cy);
						// cerr << "> " << p << " " << tx << " " << cx << " " << cy << endl;
						updmsk(cmk[tx], cmk[p]);
						if (dok(tx, cx, cy) && !pok)
							g[y].push_back(tx);
						break;
					}
				if (ok)
				{
					// cerr << "res " << cx << " " << cy << endl;
					push(y, p, cx, cy);
				}
			}
			ad[x].clear();
			// cerr << x << " " << y << " merged" << endl;
			if (inv)
				swap(x, y), swap(ad[x], ad[y]), swap(g[x], g[y]);
			dsu[x] = y, siz[y] += siz[x];
		}
		// cerr << "? " << fnd(id) << endl;
		// for (auto p : g[fnd(id)])
		// 	cerr << p % nm << " ";
		// cerr << endl;
		// for (auto p : ad[fnd(id)])
		// 	cerr << p << " ";
		// cerr << endl;
	}
	ed[id] = ind;
}

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int n, sl;
	
	cin >> sl >> n >> m >> s;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
		{
			cin >> d[i][j];
			if (d[i][j] == 0)
				d[i][j] = INF;
		}
	nm = n * m;
	
	for (int i = 0; i < sdr; i++)
	{
		int j = 0;
		for (; j < sl && ((i >> gid(s[j])) & 1); j++);
		if (j == sl)
		{
			c[i] = INF - 1;
			continue;
		}
		c[i] = j;
		int sp = j, k = j;
		// cerr << "??? " << i << " " << j << endl;
		while  (k < sl)
		{
			for (j = k; j < sl && !((i >> gid(s[j])) & 1); j++);
			for (k = j; k < sl && ((i >> gid(s[k])) & 1); k++);
			// cerr << j << " " << k << endl;
			chmax(c[i], k - j);
		}
		chmax(c[i], k - j + sp);
		// cerr << i << " " << c[i] << endl;
	}
	
	for (int i = 0, x = 0; i < n; i++)
		for (int j = 0; j < m; j++, x++)
			for (int k = 0, tx = x + nm; k < drs; k++, tx += nm)
				cmk[tx] = (1 << k);
	
	iota(dsu, dsu + n * m * (drs + 1), 0);
	fill(siz, siz + n * m, 1);
	for (int i = 0, x = 0; i < n; i++)
		for (int j = 0; j < m; j++, x++)
		{
			if (i < n - 1) push(x, x + m + nm, i + 1, j);
			if (j) push(x, x - 1 + nm * 2, i, j - 1);
			if (i) push(x, x - m + nm * 3, i - 1, j);
			if (j < m - 1) push(x, x + 1 + nm * 4, i, j + 1);
		}
	
	fill(ed, ed + n * m, INF);
	for (int i = 0, x = 0; i < n; i++)
		for (int j = 0; j < m; j++, x++) if (!vis[x] && d[i][j] != INF)
			dfs(x);
	for (auto [x, y] : es)
		if (fnd(x) != fnd(y))
			bd[fnd(x)] = 1;
	for (int i = 0, x = 0; i < n; i++)
		for (int j = 0; j < m; j++, x++)
			if (d[i][j] != INF && !bd[fnd(x)])
			{
				int id = fnd(x);
				// cerr << i << " " << j << endl;
				if (siz[id] < mn)
					mn = siz[id], mnc = 1;
				else if (siz[id] == mn)
					mnc++;
			}
	cout << mn << "\n" << mnc << endl;
	
	return 0;
}
// started coding at: 01-08 22:03:13