Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Anton and Chess

time limit per test

4 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputAnton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an infinite one instead.

The first task he faced is to check whether the king is in check. Anton doesn't know how to implement this so he asks you to help.

Consider that an infinite chess board contains one white king and the number of black pieces. There are only rooks, bishops and queens, as the other pieces are not supported yet. The white king is said to be in check if at least one black piece can reach the cell with the king in one move.

Help Anton and write the program that for the given position determines whether the white king is in check.

Remainder, on how do chess pieces move:

- Bishop moves any number of cells diagonally, but it can't "leap" over the occupied cells.
- Rook moves any number of cells horizontally or vertically, but it also can't "leap" over the occupied cells.
- Queen is able to move any number of cells horizontally, vertically or diagonally, but it also can't "leap".

Input

The first line of the input contains a single integer *n* (1 ≤ *n* ≤ 500 000) — the number of black pieces.

The second line contains two integers *x*_{0} and *y*_{0} ( - 10^{9} ≤ *x*_{0}, *y*_{0} ≤ 10^{9}) — coordinates of the white king.

Then follow *n* lines, each of them contains a character and two integers *x*_{i} and *y*_{i} ( - 10^{9} ≤ *x*_{i}, *y*_{i} ≤ 10^{9}) — type of the *i*-th piece and its position. Character 'B' stands for the bishop, 'R' for the rook and 'Q' for the queen. It's guaranteed that no two pieces occupy the same position.

Output

The only line of the output should contains "YES" (without quotes) if the white king is in check and "NO" (without quotes) otherwise.

Examples

Input

2

4 2

R 1 1

B 1 5

Output

YES

Input

2

4 2

R 3 3

B 1 5

Output

NO

Note

Picture for the first sample:

Picture for the second sample:

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/07/2021 04:31:36 (i3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|