#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
using namespace std;
struct rec
{
int x,y,biao;
}point[1000100];
int n;
int cmp1(rec a,rec b)
{
if (a.x+a.y!=b.x+b.y) return a.x+a.y<b.x+b.y;
return a.x<b.x;
}
int cmp2(rec a,rec b)
{
if (a.x-a.y!=b.x-b.y) return a.x-a.y<b.x-b.y;
return a.x<b.x;
}
int cmp3(rec a,rec b)
{
if (a.x!=b.x) return a.x<b.x;
return a.y<b.y;
}
int cmp4(rec a,rec b)
{
if (a.y!=b.y) return a.y<b.y;
return a.x<b.x;
}
int main()
{
freopen("in.txt","r",stdin);
bool flag=false;
scanf("%d",&n);
scanf("%d%d",&point[n+1].x,&point[n+1].y);
point[n+1].biao=0;
char ch;
int x,y;
for (int i=1;i<=n;i++)
{
scanf(" %c%d%d",&ch,&x,&y);
if (ch=='R') point[i].biao=1;
if (ch=='B') point[i].biao=2;
if (ch=='Q') point[i].biao=3;
point[i].x=x,point[i].y=y;
}
sort(point+1,point+n+2,cmp1);
for (int i=1;i<=n+1;i++)
if (point[i].biao==0)
{
//cout<<point[i].x<<" "<<point[i].y<<endl;
//cout<<point[i+1].x<<" "<<point[i+1].y<<" "<<point[i+1].biao<<endl;
if (i-1>0&&i-1<=n+1&&(point[i-1].biao==2||point[i-1].biao==3)&&(point[i-1].x+point[i-1].y)==(point[i].x+point[i].y)) flag=true;
if (i+1>0&&i+1<=n+1&&(point[i+1].biao==2||point[i+1].biao==3)&&(point[i+1].x+point[i+1].y)==(point[i].x+point[i].y)) flag=true;
}
sort(point+1,point+n+2,cmp2);
for (int i=1;i<=n+1;i++)
if (point[i].biao==0)
{
if (i-1>0&&i-1<=n+1&&(point[i-1].biao==2||point[i-1].biao==3)&&(point[i-1].x-point[i-1].y==point[i].x-point[i].y)) flag=true;
if (i+1>0&&i+1<=n+1&&(point[i+1].biao==2||point[i+1].biao==3)&&(point[i+1].x-point[i+1].y==point[i].x-point[i].y)) flag=true;
}
sort(point+1,point+n+2,cmp3);
for (int i=1;i<=n+1;i++)
if (point[i].biao==0)
{
if (i-1>0&&i-1<=n+1&&(point[i-1].biao==1||point[i-1].biao==3)&&point[i-1].x==point[i].x) flag=true;
if (i+1>0&&i+1<=n+1&&(point[i+1].biao==1||point[i+1].biao==3)&&point[i+1].x==point[i].x) flag=true;
}
sort(point+1,point+n+2,cmp4);
for (int i=1;i<=n+1;i++)
if (point[i].biao==0)
{
if (i-1>0&&i-1<=n+1&&(point[i-1].biao==1||point[i-1].biao==3)&&point[i-1].y==point[i].y) flag=true;
if (i+1>0&&i+1<=n+1&&(point[i+1].biao==1||point[i+1].biao==3)&&point[i+1].y==point[i].y) flag=true;
}
if (flag) printf("YES\n");
else printf("NO\n");
return 0;