#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;

int C, R, E;
unordered_set<int> walls;
unordered_map<int, int> dist;
unordered_map<int, int> bump;
vi unhasher(int h) {
    return {h % 51, (h = h / 51) % 51, (h = h / 51) % 51, (h = h / 51) % 51};
}

int hasher(int x1, int y1, int x2, int y2) {
    int h = 0;
    h += y2;
    h *= 51;
    h += x2;
    h *= 51;
    h += y1;
    h *= 51;
    h += x1;
    return h;
}

void update(int x1, int y1, int x2, int y2, int d, int b, queue<int> &q) {
    if(x1 == x2 && y1 == y2 && y1 != 0) return;
    int h = hasher(x1, y1, x2, y2);
    if(dist.find(h) == dist.end()) {
        dist[h] = d;
        bump[h] = b;
        q.push(h);
    }
    if(dist[h] < d) return;
    else if(dist[h] == d) {
        bump[h] = min(bump[h], b);
        return;
    }
    dist[h] = d;
    bump[h] = b;
}

bool isThereAWall(int x1, int y1, int x2, int y2) {
    if(x1 == x2 && y1 == y2) return false;
    if(x1 == x2 && x1 == E && max(y1, y2) == 1) return false;
    if(!x1 || !x2 || !y1 || !y2) return true;
    if(max(x1, x2) > C || max(y1, y2) > R) return true;
    if(x1 != x2) {
        if(x1 > x2) {
            swap(x1, x2);
        }
        return walls.find(x1 * 51 * 51 * 51 + y1 * 51 * 51) != walls.end();
    } else {
        if(y1 > y2) {
            swap(y1, y2);
        }
        return walls.find(x1 * 51 + y1) != walls.end();
    }
}



pair<int, int> nextStep(int x, int y, int dir) {
    if(y == 0) return {x, y};
    if(dir == 0) return {x, y+1};
    if(dir == 1) return {x+1, y};
    if(dir == 2) return {x, y-1};
    if(dir == 3) return {x-1, y};
    return {x, y};
}
int bumped = 0;

pair<int, int> nextS(int x, int y, int dir) {
    bumped = 0;
    auto p = nextStep(x, y, dir);
    if(!isThereAWall(x, y, p.first, p.second)) return {p.first, p.second};
    bumped = 1;
    return {x, y};
}





void solve() {
    cin >> C >> R >> E;
    int C1, R1, C2, R2;
    char D1, D2;
    cin >> C1 >> R1 >> D1 >> C2 >> R2 >> D2;
    int N1; cin >> N1;
    unordered_map<char, int> orientation;
    orientation['N'] = 0;
    orientation['E'] = 1;
    orientation['S'] = 2;
    orientation['W'] = 3;
    int d1 = orientation[D1];
    int d2 = orientation[D2];
    int diff = (d2 - d1 + 4) % 4;
    for(int i = 0; i < N1; i++) {
        int c1, r1; cin >> c1 >> r1;
        walls.insert(c1 * 51 + r1);
    }
    int N2; cin >> N2;
    for(int i = 0; i < N2; i++) {
        int c1, r1; cin >> c1 >> r1;
        walls.insert(c1 * 51 * 51 * 51 + r1 * 51 * 51);
    }
    dist[hasher(C1, R1, C2, R2)] = 0;
    bump[hasher(C1, R1, C2, R2)] = 0;
    queue<int> q;
    q.push(hasher(C1, R1, C2, R2));
    while(!q.empty()) {
        int curr = q.front();
        vi coords = unhasher(curr);
        // cout << coords[0] << " " << coords[1] << " " << coords[2] <<" " << coords[3] << "\n";
        // cout << dist[curr] << " " << bump[curr] << "\n";
        q.pop();
        if(coords[1] == 0) {
            if(coords[3] == 0) break;
            for(int i = 0; i < 4; i++) {
                auto nextc = nextS(coords[2], coords[3], i);
                update(coords[0], coords[1], nextc.first, nextc.second, dist[curr] + 1, bump[curr], q);
            }
        } if(coords[3] == 0) {
            for(int i = 0; i < 4; i++) {
                auto nextc = nextS(coords[0], coords[1], i);
                update(nextc.first, nextc.second, coords[2], coords[3],  dist[curr] + 1, bump[curr], q);
            }
        }
        for(int i = 0; i < 4; i++) {
            int bumper = 0;
            auto nextc1 = nextS(coords[0], coords[1], i);
            bumper += bumped;
            auto nextc2 = nextS(coords[2], coords[3], (i + diff) % 4);
            bumper += bumped;
            update(nextc1.first, nextc1.second, nextc2.first, nextc2.second, dist[curr] + 1, bump[curr] + bumper, q);
        }
    }
    cout << dist[hasher(E, 0, E, 0)] << " " << bump[hasher(E, 0, E, 0)] <<"\n";
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int T = 1;
    // cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}