Barr the Bear is playing a game of chess with Kang the Penguin. After an intense game, Barr the Bear has managed to trade down into an endgame with two rooks remaining, while Kang the Penguin only has 1 lone king left. However, disaster suddenly struck: Barr the Bear forgot how to tell whether a position is checkmate! Running away from the uncontrollable laughter of Kang the Penguin, Barr the Bear is seeking your help: Given the position of Barr the Bear's king and two rooks, and Kang the Penguin's king, find out whether a particular position is checkmate.

Note: Kings can attack all 8 squares surrounding it. Therefore, a king can attack up to a total of 8 squares. Rooks can attack any number of squares horizontally and vertically. A king is checkmated if he is currently being attacked and cannot move to a square that is not being attacked. It is guaranteed that no two pieces will occupy the same square, and that the two kings cannot take each other ie the two kings will not be simultaneously attacking each other. You cannot capture a protected piece, but you can capture an unprotected piece.

## Input

The input contains 4 space-separated piece positions: positions of the two white rooks, the white king and the black king. Barr the Bear controls the white pieces and Kang the Penguin controls the black pieces. Each position on the 8 x 8 chessboard is denoted by two symbols - ('a' - 'h') and ('1' - '8') - which stand for horizontal and vertical coordinates of the cell occupied by the piece.

## Output

On a single line, output "BARR THE BEAR PWWWWNNNNEEEDDD KANG THE PENGUIN!!!!!!!!!!!!" if the Kang the Penguin's king is checkmated or "OMG KANG THE PENGUIN SUUUUURRRVVVIIIVVVEEEEDDD!!!!!" otherwise.

## Sample Input 1

a6 b4 c8 a8

## Sample Output 1

BARR THE BEAR PWWWWNNNNEEEDDD KANG THE PENGUIN!!!!!!!!!!!!

## Sample Input 2

a6 c4 b6 b8

## Sample Output 2

OMG KANG THE PENGUIN SUUUUURRRVVVIIIVVVEEEEDDD!!!!!

## Sample Input 3

a2 b1 a3 a1

## Sample Output 3

OMG KANG THE PENGUIN SUUUUURRRVVVIIIVVVEEEEDDD!!!!!