#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int dir(char c) {
    if (c == 'N') return 0;
    else if (c == 'E') return 1;
    else if (c == 'S') return 2;
    else return 3;
}

int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};

bool wall[51][51][4];
pair<int,int> dp[2501][2501];

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int w,h; cin >> w >> h;
    int e; cin >> e; e -= 1;

    int y1,x1,d1; cin >> y1 >> x1;
    y1 -= 1; x1 -= 1;
    char cd; cin >> cd;
    d1 = dir(cd);

    int y2,x2,d2; cin >> y2 >> x2;
    y2 -= 1; x2 -= 1; cin >> cd;
    d2 = dir(cd);

    for (int i = 0; i < w; ++i) {
        wall[h-1][i][0] = true;
        wall[0][i][2] = true;
    }
    for (int i = 0; i < h; ++i) {
        wall[i][0][3] = true;
        wall[i][w-1][1] = true;
    }
    wall[0][e][2] = false;

    int n; cin >> n;
    for (int i = 0; i < n; ++i) {
        int y,x; cin >> y >> x;
        y -= 1; x -= 1;
        wall[x][y][0] = true;
        wall[x+1][y][2] = true;
    }
    cin >> n;
    for (int i = 0; i < n; ++i) {
        int y,x; cin >> y >> x;
        y -= 1; x -= 1;
        wall[x][y][1] = true;
        wall[x][y+1][3] = true;
    }

    n = h*w;
    auto idx = [&](int x, int y) -> int {
        return x*w + y;
    };
    auto f = [&](int pl, int d) -> int {
        if (pl == n) return n;
        int x = pl/w, y = pl%w;
        if (wall[x][y][d]) return pl;
        x += dx[d], y += dy[d];
        if (x == -1) return n;
        return idx(x,y);
    };


    deque<pair<int,int>> dq[2];
    {
        int a = idx(x1, y1);
        int b = idx(x2, y2);
        for (int i = 0; i < 2501; ++i) {
            for (int j = 0; j < 2501; ++j) {
                dp[i][j] = {1e9, 1e9};
            }
        }
        dp[a][b] = {0, 0};
        dq[0].push_front({a, b});
    }
    int cur = 0;

    while (1) {
        if (dq[cur].size() == 0) cur ^= 1;
        if (dq[cur].size() == 0) break;
        auto p = dq[cur].front(); dq[cur].pop_front();
        if (p.first == n and p.second == n) break;
//        cout << p.first << " " << p.second << endl;
        auto pre = dp[p.first][p.second];
        for (int i = 0; i < 4; ++i) {
            int nd1 = (d1 + i) % 4;
            int nd2 = (d2 + i) % 4;

            pair<int,int> pp = {f(p.first, nd1), f(p.second, nd2)};
//            cout << " " << pp.first << " " << pp.second << endl;
            if (p.first == pp.first and p.second == pp.second) continue;
            int crh = (p.first == pp.first and p.first != n) + (p.second == pp.second and p.second != n);
            if (p.first == pp.second and p.second == pp.first) continue;
            if (p.second == pp.first and p.first == pp.second) continue;
            if (pp.second != n and pp.first == pp.second) continue;

            pair<int,int> cost = {pre.first+1, pre.second+crh};
            if (dp[pp.first][pp.second] > cost) {
                dp[pp.first][pp.second] = cost;
                if (crh) dq[cur^1].push_back(pp);
                else dq[cur^1].push_front(pp);
            }
        }
    }


    cout << dp[h*w][h*w].first << " " << dp[h*w][h*w].second << endl;
}