#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int dx[4] = {1,  0, -1,  0};
const int dy[4] = {0, -1,  0,  1};
const char ch[4] = {'E', 'S', 'W', 'N'};
typedef long long ll;
int n, m, posx[MAXN], posy[MAXN];
int sx, sy, h[MAXN];
vector <pair <int, int>> a[MAXN];
int sgn(int x) {
	if (x == 0) return 0;
	if (x > 0) return 1;
	else return -1;
}
bool todir(int from, int to, int id) {
	int dtx = posx[to] - posx[from];
	int dty = posy[to] - posy[from];
	return sgn(dtx) == dx[id] && sgn(dty) == dy[id];
}
int getdir(int from, int to) {
	for (int i = 0; i <= 3; i++)
		if (todir(from, to, i)) return i;
	assert(false);
	return -1;
}
int getid(int from, int to) {
	for (auto x : a[from])
		if (x.first == to) return x.second;
	assert(false);
	return -1;
}
void getnxt(int from, int to) {
	int dir = getdir(from, to);
	vector <int> nxt;
	for (int dd = -1; dd <= 1; dd++) {
		int ndir = (dir + dd + 4) % 4;
		for (auto x : a[to])
			if (todir(to, x.first, ndir) && h[x.second] > 0) {
				nxt.push_back(x.first);
			}
	}
	if (nxt.size() == 0) {
		cout << posx[to] << ' ' << posy[to] << endl;
		exit(0);
	}
	sx = to;
	if (nxt.size() == 1) sy = nxt[0];
	if (nxt.size() == 2) sy = nxt[0];
	if (nxt.size() == 3) sy = nxt[1];
}
int x[MAXN], y[MAXN], vis[MAXN][2];
void work() {
	for (int i = 1; i <= m; i++)
		vis[i][0] = vis[i][1] = 0;

	int pos = 1; x[1] = sx, y[1] = sy;
	int id = getid(x[1], y[1]);
	vis[id][x[pos] < y[pos]] = pos;
	h[id]--; 
	getnxt(x[pos], y[pos]);
	// cerr << x[1] << ' ';
	if (h[id] == 0) return;

	while (true) {
		pos++;
		x[pos] = sx;
		// cerr << x[pos] << ' ';
		y[pos] = sy;
		id = getid(x[pos], y[pos]);

		if (vis[id][x[pos] < y[pos]] != 0) {
			int last = vis[id][x[pos] < y[pos]];
			static int cnt[MAXN];
			for (int i = last + 1; i <= pos; i++)
				cnt[getid(x[i], y[i])]++;
			
			int minh = INT_MAX;
			for (int i = last + 1; i <= pos; i++)
				minh = min(minh, (h[getid(x[i], y[i])] - 1) / cnt[getid(x[i], y[i])]);
			
			for (int i = last + 1; i <= pos; i++)
				cnt[getid(x[i], y[i])]--;
			
			// assert(minh >= 1);
			for (int i = last + 1; i <= pos; i++)
				h[getid(x[i], y[i])] -= minh;
			h[id]--;
			getnxt(x[pos], y[pos]);
			return;
		}

		vis[id][x[pos] < y[pos]] = pos;
		h[id]--;
		getnxt(x[pos], y[pos]);
		if (h[id] == 0) return;
	}
}
int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++)
		scanf("%d%d", &posx[i], &posy[i]);
	for (int i = 1; i <= m; i++) {
		int x, y;
		scanf("%d%d%d", &x, &y, &h[i]);
		a[x].emplace_back(y, i);
		a[y].emplace_back(x, i);
	}
	sx = 0, sy = 0; char sd;
	scanf("%d %c", &sx, &sd);
	int id = 0; while (ch[id] != sd) id++;
	for (auto x : a[sx])
		if (todir(sx, x.first, id)) sy = x.first;
	assert(sy != 0);
	while (true) {
		work();
	}
	return 0;
}