D 求调

#include<bits/stdc++.h>
using namespace std;
int n,m;
long long x,y;
long long xx,yy;
long long c;
char d;
map<long long,set<long long> >mp;
int ans;
int main() {
	cin>>n>>m>>x>>y;
	for(int i=1;i<=n;i++){
		cin>>xx>>yy;
		mp[xx].insert(yy);
		mp[yy].insert(xx);
	}
	for(int i=1;i<=m;i++){
		long long sx=x,sy=y;
		cin>>d>>c;
		if(d=='L'){
			sx-=c;
			while(mp[y].lower_bound(sx)!=mp[y].end()&&(*(mp[y].lower_bound(sx)))<=x){
				long long v=*(mp[y].lower_bound(sx));
				mp[y].erase(v);
				if(v!=y)mp[v].erase(y);
				ans++;
			}
		}
		if(d=='R'){
			sx+=c;
			while(mp[y].lower_bound(x)!=mp[y].end()&&(*(mp[y].lower_bound(x)))<=sx){
				long long v=*(mp[y].lower_bound(x));
				mp[y].erase(v);
				if(v!=y)mp[v].erase(y);
				ans++;
			}
		}
		if(d=='D'){
			sy-=c;
			while(mp[x].lower_bound(sy)!=mp[x].end()&&(*(mp[x].lower_bound(sy)))<=y){
				long long v=*(mp[x].lower_bound(sy));
				mp[x].erase(v);
				if(v!=x)mp[v].erase(x);
				ans++;
			}
		}
		if(d=='U'){
			sy+=c;
			while(mp[x].lower_bound(y)!=mp[x].end()&&(*(mp[x].lower_bound(y)))<=sy){
				long long v=*(mp[x].lower_bound(y));
				mp[x].erase(v);
				if(v!=x)mp[v].erase(x);
				ans++;
			}
		}
		x=sx;y=sy;
		//cout<<x<<' '<<y<<endl;
	}
	cout<<x<<' '<<y<<' '<<ans<<endl;
	return 0;
}