A. Battleship
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Battleship is a game in which one player tries to guess the location of his opponent's ships.

For example, suppose your board looks like this:

  0 1 2 3 4
0 O O O S O
1 O S O S O
2 O O O O O
3 S S O O O
4 O S O O O

where O represents a tile of the ocean and S represents a ship.

If your opponent guesses $$$(3,1)$$$, representing the tile in row 3 and column 1, they would hit a ship.

If your opponent guesses $$$(4,4)$$$, representing the tile in row 4 and column 4, they would miss and hit the ocean.

Given the state of an $$$n\times n$$$ board and the coordinates your opponent guesses, return "No" if your opponent hits a ship and "Yes" if your opponent misses.

Input

The first line contains three integers $$$n,r,c$$$ $$$(1\le n\le 100,0\le r,c \lt n)$$$, indicating the size of the board and the coordinates $$$(r,c)$$$ your opponent guesses.

The next $$$n$$$ lines each contain $$$n$$$ characters, O or S, indicating whether the position is the ocean or a ship.

Output

Print "No" if your opponent hits a ship and "Yes" otherwise.

Example
Input
5 3 1
O O O S O
O S O S O
O O O O O
S S O O O
O S O O O
Output
No