#include<bits/stdc++.h>
using namespace std;
int main()
{
	ios_base::sync_with_stdio(false);
	int n,m;
	cin>>n>>m;
	vector<pair<int,int>> p(n+5);
	vector<vector<pair<int,int>>> G(n+5,vector<pair<int,int>>(4));
	for(int i=1;i<=n;i++)
	{
		int x,y;
		cin>>x>>y;
		p[i]={x,y};
	}
	vector<int> dx={0,-1,0,1},dy={1,0,-1,0};
	/*
	0123
	NWSE
	*/
	auto getty=[&](int u,int v)
	{
		if(p[u].first==p[v].first){if(p[u].second>p[v].second)return 2;else return 0;}
		else {if(p[u].first>p[v].first)return 1;else return 3;}
	};
	vector<int> rem(m+5);
	for(int i=1;i<=m;i++)
	{
		int u,v,w;
		cin>>u>>v>>w;
//		cerr<<"edge "<<u<<' '<<getty(u,v)<<' '<<v<<endl;
		G[u][getty(u,v)]={v,i};
//		cerr<<"edge "<<v<<' '<<getty(v,u)<<' '<<u<<endl;
		G[v][getty(v,u)]={u,i};
		rem[i]=w;
	}
	int now=0,dir=0;
	char ch;
	cin>>now>>ch;
	switch(ch)
	{
		case 'N':dir=0;break;
		case 'W':dir=1;break;
		case 'S':dir=2;break;
		case 'E':dir=3;break;
	}
	vector<vector<int>> vis(n+5,vector<int>(4));
	auto go=[&](int x,int d,int first)
	{
		if(first)
		{
			return make_pair(G[x][d].first,d);
		}
		d^=2;
		vector<int> tmp;
		for(int i=1;i<=3;i++)
			if(G[x][(d+i)%4].first)
				tmp.push_back(i);
		int sz=tmp.size();
		if(sz==0)return make_pair(-1,-1);
		if(sz<=1)return make_pair(G[x][(d+tmp[0])%4].first,(d+tmp[0])%4);
		return make_pair(G[x][(d+tmp[1])%4].first,(d+tmp[1])%4);
	};
	int first=1;
	deque<pair<int,int>> q;
	while(1)
	{
//		cerr<<"go "<<now<<' '<<dir<<endl;
		if(vis[now][dir]==1)
		{
			while(q.front()!=make_pair(now,dir))
			{
				q.pop_front();
			}
			vector<int> cnt(m+5);
			for(auto [u,d]:q)
			{
				cnt[G[u][d^2].second]++;
			}
			int minn=1e9;
			for(int i=1;i<=m;i++)
			{
				if(cnt[i])
					minn=min(minn,rem[i]/cnt[i]);
			}
			if(minn>=2)
			{
//				cerr<<"elim cycle "<<minn<<endl;
				for(auto [u,d]:q)
					rem[G[u][d^2].second]-=minn-1;
			}
			for(int i=1;i<=n;i++)fill(vis[i].begin(),vis[i].end(),0);
			q.clear();
		}
		vis[now][dir]=1;
		q.emplace_back(now,dir);
		auto [nxt,nd]=go(now,dir,first);
		first=0;
//		cerr<<"arrive "<<nxt<<' '<<nd<<endl;
		if(nxt==-1)
		{
			cout<<p[now].first<<' '<<p[now].second<<endl;
			return 0;
		}
		int eid=G[nxt][nd^2].second;
		rem[eid]--;
		if(rem[eid]==0)
		{
//			cerr<<"remove edge "<<now<<' '<<nxt<<endl;
			G[now][nd]=G[nxt][nd^2]=make_pair(0,0);
			for(int i=1;i<=n;i++)fill(vis[i].begin(),vis[i].end(),0);
			q.clear();
		}
		now=nxt;dir=nd;
	}
	return 0;
}