Jealous Jinseo

Kim Jinseo, the Eric Nam of the computer science department, gets angry whenever he sees someone better looking than himself nearby.

Jinseo is sitting in a lecture room, waiting for class. The room holds $N$ rows and $N$ columns of chairs, and one person sits in every chair.

The person in row $i$ and column $j$ has charm $X[i][j]$. Of two people, the one with the higher charm is the better looking one.

Jinseo sees only the people sitting in his own row and the people sitting in his own column.

Jinseo sits in the chair in row $a$ and column $b$. Print ANGRY if any person Jinseo sees is better looking than he is, and HAPPY otherwise.

The first line contains the number of rows and columns of chairs $N$ ($1 \le N \le 1000$) and the row $a$ and column $b$ of Jinseo's chair ($1 \le a, b \le N$).

Each of the next $N$ lines holds the charms of the people sitting in one row. The $j$-th number on the $i$-th of those lines is $X[i][j]$ ($1 \le X[i][j] \le 50000$), the charm of the person in row $i$ and column $j$.

Print ANGRY if any person Jinseo sees is better looking than he is, and HAPPY otherwise.