#include <bits/stdc++.h>
#define dbg(x) cerr << #x << ':' << (x) << endl; 
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) x.begin(),x.end()

int n,m;
vector<int> x,y;
vector<vector<array<int,3>>> g;
int start,sdir;

vector<vector<bool>> vis;
vector<int> cnt;
vector<pair<int,int>> his;
int rev[] = {2,3,0,1};

array<int,3> select(int pos, int dir, int dec) {
    if (dec >= 0 && g[pos][dec][1] > 0) {
        int to = g[pos][dec][0];
        int cap = g[pos][dec][1];
        return {to,dec,cap};
    }
    vector<int> cand;
    for (int i = 0; i < 4; ++i) if (i != rev[dir]) {
        if (g[pos][i][1] > 0) {
            cand.push_back(i);
        }
    }
    // cerr << "cand: ";
    // for (int i : cand) cerr << i << "(" << g[pos][i][1] << ")" << ' ';
    // cerr << '\n';

    if (cand.size() == 0) {
        return {-1,-1,-1};
    }
    else if (cand.size() == 1) {
        int nd = cand[0];
        int to  = g[pos][nd][0];
        int cap = g[pos][nd][1];
        return {to,nd,cap};
    }
    else if (cand.size() == 2) {
        int nd;
        for (int i = 1; i <= 3; ++i) {
            nd = (rev[dir] + i) % 4;
            if (g[pos][nd][1] > 0) {
                break;
            }
        }
        int to = g[pos][nd][0];
        int cap = g[pos][nd][1];
        return {to,nd,cap};
    }
    else if (cand.size() == 3) {
        int nd;
        bool first = true;
        for (int i = 1; i <= 3; ++i) {
            nd = (rev[dir] + i) % 4;
            if (g[pos][nd][1] > 0) {
                if (first) {
                    first = false;
                }
                else {
                    break;
                }
            }
        }
        int to = g[pos][nd][0];
        int cap = g[pos][nd][1];
        return {to,nd,cap};
    }
    else {
        assert(false);
    }
}

array<int,3> sim(int pos, int dir) {
    int dec = dir;
    while (true) {
        // cerr << "[" << pos << ' ' << dir << "]\n";
        // cerr << "[" << x[pos] << ' ' << y[pos] << "]\n";

        auto [nx,ndir,cap] = select(pos, dir, dec);
        if (nx == -1) {
            return {1,pos,dir};
        }

        if (vis[pos][ndir]) {
            break;
        }
        else {
            g[pos][ndir][1] -= 1;
            int to = g[pos][ndir][0];
            g[to][rev[ndir]][1] -= 1;

            int eid = g[pos][ndir][2];
            cnt[eid] += 1;

            his.emplace_back(pos, ndir);
            vis[pos][ndir] = true;

            pos = nx;
            dir = ndir;
        }
        dec = -1;
    }
    int mi = 1e9;
    for (auto [p,d] : his) {
        int eid = g[p][d][2];
        assert(cnt[eid] != 0);
        mi = min(mi, g[p][d][1] / cnt[eid]);
    }
    // dbg(mi)

    for (auto [p,d] : his) {
        int eid = g[p][d][2];
        g[p][d][1] -= mi * cnt[eid];
        int to = g[p][d][0];
        g[to][rev[d]][1] -= mi * cnt[eid];

        cnt[eid] = 0;
        vis[p][d] = false;
    }
    his.clear();
    for (int i = 0; i < n; ++i) for (int j = 0; j < 4; ++j) assert(vis[i][j] == 0);
    return {0,pos,dir};
}

int main()
{
    cin >> n >> m;
    x.resize(n);
    y.resize(n);
    g.resize(n, vector<array<int,3>>(4));
    vis.resize(n, vector<bool>(4));
    cnt.resize(m);
    for (int i = 0; i < n; ++i) cin >> x[i] >> y[i];
    for (int i = 0; i < m; ++i) {
        int a,b,c;
        cin >> a >> b >> c;
        --a; --b;
        if (x[a] > x[b]) {
            g[a][3][0] = b;
            g[b][1][0] = a;
            g[a][3][1] = g[b][1][1] = c;
            g[a][3][2] = g[b][1][2] = i;
        }
        else if (x[a] < x[b]) {
            g[a][1][0] = b;
            g[b][3][0] = a;
            g[a][1][1] = g[b][3][1] = c;
            g[a][1][2] = g[b][3][2] = i;
        }
        else if (y[a] > y[b]) {
            g[a][2][0] = b;
            g[b][0][0] = a;
            g[a][2][1] = g[b][0][1] = c;
            g[a][2][2] = g[b][0][2] = i;
        }
        else if (y[a] < y[b]) {
            g[a][0][0] = b;
            g[b][2][0] = a;
            g[a][0][1] = g[b][2][1] = c;
            g[a][0][2] = g[b][2][2] = i;
        }
        else {
            assert(false);
        }
    }
    char c;
    cin >> start >> c;
    --start;
    if (c == 'N') sdir = 0;
    else if (c == 'E') sdir = 1;
    else if (c == 'S') sdir = 2;
    else sdir = 3;

    int pos = start, dir = sdir;
    while (true) {
        // cerr << pos << ' ' << dir << endl;
        // cerr << x[pos] << ' ' << y[pos] << endl;
        auto [end, nx, ndir] = sim(pos, dir);
        // cerr << end << ' ' << nx << ' ' << ndir << '\n';
        if (end) {
            cout << x[nx] << ' ' << y[nx] << '\n';
            return 0;
        }
        pos = nx;
        dir = ndir;
    }
}