#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int N = 54;
bool br[N][N];
bool bc[N][N];
int df = 0;
int n, m, e;

vector<PII> g[N * N * N * N];
int w[N * N * N * N];
int mn[N * N * N * N];

string dir = "SWNE";	

bool fin(int x1, int y1)
{
	return (y1 == 0 && x1 == e);
}
PII bl(int x1, int y1, int di)
{
	if(fin(x1, y1))
		return {x1, y1};
		
	if (di == 0) return {x1, y1 - !br[x1][y1 - 1]};
	if (di == 1) return {x1 - !bc[x1 - 1][y1], y1};
	if (di == 2) return {x1, y1 + !br[x1][y1]};
	if (di == 3) return {x1 + !bc[x1][y1], y1};
	assert(0);
}

int calc(int x1, int y1, int x2, int y2)
{
	return x1 * N * N * N + y1 * N * N + x2 * N + y2;
}

void build()
{
	FOR(x1, 1, n + 1) FOR(y1, 0, m + 1) FOR(x2, 1, n + 1) FOR(y2, 0, m + 1)
	{
		if (y1 == 0 && !fin(x1, y1)) continue;
		if (y2 == 0 && !fin(x2, y2)) continue;
		FOR(di, 0, 4)
		{
			auto [nx1, ny1] = bl(x1, y1, di);
			auto [nx2, ny2] = bl(x2, y2, (di + df) % 4);
			int bum = 0;
			if (x1 == nx1 && y1 == ny1 && !fin(x1, y1)) bum++;
			if (x2 == nx2 && y2 == ny2 && !fin(x2, y2)) bum++;
			if (bum == 2) continue;
			int X = calc(x1, y1, x2, y2);
			int Y = calc(nx1, ny1, nx2, ny2);
			g[X].PB({Y, bum});
		}
	}
}

const int INF = 1e9;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m >> e;
	int x1, y1, x2, y2;
	char c1, c2;
	cin >> x1 >> y1 >> c1 >> x2 >> y2 >> c2;
	int dir1 = 0;
	int dir2 = 0;
	FOR(i, 0, 4) if (dir[i] == c1) dir1 = i;
	FOR(i, 0, 4) if (dir[i] == c2) dir2 = i;
	df = (dir2 + 4 - dir1) % 4;
	int sz;
	cin >> sz;
	FOR(i, 0, sz)
	{
		int a, b;
		cin >> a >> b;
		br[a][b] = 1;
	}
	cin >> sz;
	FOR(i, 0, sz)
	{
		int a, b;
		cin >> a >> b;
		bc[a][b] = 1;
	}
	//cout << bc[3][4] << '\n';
	//cout << 3 + !bc[3][4] << '\n';
	//return 0;
	FOR(i, 0, n)
		if (i + 1 != e) br[i + 1][0] = 1;
	FOR(i, 0, m)
		bc[0][i + 1] = 1;
		
	build();
	
	int st = calc(x1, y1, x2, y2);
	FOR(i, 0, N * N * N * N) w[i] = INF;
	w[st] = 0;
	queue<int> q;
	q.push(st);
	while(!q.empty())
	{
		int v = q.front();
		q.pop();
		for (auto [to, b] : g[v])
		{
			if (w[to] > w[v] + 1)
			{
				q.push(to);
				w[to] = w[v] + 1;
				mn[to] = mn[v] + b;
			}
			if (w[to] == w[v] + 1)
				mn[to] = min(mn[to], mn[v] + b);
			
		}
	}
	int end = e * N * N * N + e * N;
	cout << w[end] << ' ' << mn[end] << '\n';
		
	return 0;
}