#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
// template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(Tree <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
fastIO();
if(str == "input") {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
} else if(str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
}
const int inf = 1e9;
const int N = 805;
int a[N][N];
int m, r, c;
void solve_() {
cin >> m >> r >> c;
string s; cin >> s;
s += s;
s += s;
set<char> st;
int flag = 1;
for(auto i: s) {
st.insert(i);
if(i == 'N' || i == 'S') {
flag = 0;
}
}
for(int i = 1; i <= r; i++) {
for(int j = 1; j <= c; j++) {
cin >> a[i][j];
}
}
if(flag) {
int max_w = 0, max_e = 0;
if(sz(st) == 1) {
if(*st.begin() == 'W') max_w = inf;
else max_e = inf;
} else {
int n = sz(s);
for(int i = 0; i < n; i++) {
int j = i, cnt = 0;
while(j < n && s[j] == s[i]) {
cnt++;
j++;
}
if(s[i] == 'W') {
max_w = max(max_w, cnt);
} else {
max_e = max(max_e, cnt);
}
i = j - 1;
}
}
pair<int, int> pat;
pat = {r * c + 20, 0};
for(int i = 1; i <= r; i++) {
for(int j = 1; j <= c; j++) {
if(a[i][j] == 0) continue;
int l = j - 1, ri = j + 1, cnt = 1;
while(l >= 1 && a[i][l] && a[i][l] <= max_w) {
l--;
cnt++;
}
while(ri <= c && a[i][ri] && a[i][ri] <= max_e) {
ri++;
cnt++;
}
if(pat.first == cnt) {
pat.second++;
} else if(cnt < pat.first) {
pat = {cnt, 1};
}
}
}
assert(pat.second != 0);
cout << pat.first << "\n";
cout << pat.second << "\n";
} else {
}
}
int main() {
setIO();
auto solve = [&](int test_case)-> void {
for(int i = 1; i <= test_case; i++) {
solve_();
}
};
int test_cases = 1;
// cin >> test_cases;
solve(test_cases);
return 0;
}
