#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<map>
#include<iostream>
using namespace std;const int maxn=200010;
int n,m;
struct OP{int a,b,id;char c;
}A[maxn];
int mn[maxn<<2];
int ans[maxn];
map<int,bool>vis;bool cmp(const OP &A,const OP &B){return A.a<B.a;}
void ch_read(char &ch){ch=getchar();while(ch<'!')ch=getchar();
}
int Min(int a,int b){return A[a].id<A[b].id?a:b;}
void build(int o,int L,int R){if(L==R){mn[o]=L;return;}int mid=(L+R)>>1;//cout<<mid<<endl;build(o<<1,L,mid);build(o<<1|1,mid+1,R);mn[o]=Min(mn[o<<1],mn[o<<1|1]);
}
int ask(int o,int L,int R,int x,int y){if(L>=x&&R<=y)return mn[o];int mid=(L+R)>>1;if(y<=mid)return ask(o<<1,L,mid,x,y);else if(x>mid)return ask(o<<1|1,mid+1,R,x,y);else return Min(ask(o<<1,L,mid,x,y),ask(o<<1|1,mid+1,R,x,y));
}
void Solve(int L,int R,int Low,int Right){if(L>R)return;int now=ask(1,1,m,L,R);if(vis[A[now].a]){Solve(L,now-1,Low,Right);Solve(now+1,R,Low,Right);return;}vis[A[now].a]=true;if(A[now].c=='U'){ans[A[now].id]=A[now].b-Low;Solve(L,now-1,Low,Right);Solve(now+1,R,Low,A[now].a);}else{ans[A[now].id]=A[now].a-Right;Solve(L,now-1,A[now].b,Right);Solve(now+1,R,Low,Right);}return;
}int main(){int __size__ = 20 << 20; // 20MBchar *__p__ = (char*)malloc(__size__) + __size__;__asm__("movl %0, %%esp\n" :: "r"(__p__));scanf("%d%d",&n,&m);for(int i=1;i<=m;++i){scanf("%d%d",&A[i].a,&A[i].b);ch_read(A[i].c);A[i].id=i;}sort(A+1,A+m+1,cmp);build(1,1,m);Solve(1,m,0,0);for(int i=1;i<=m;++i)printf("%d\n",ans[i]);return 0;
}