statement


N Contestants and M problems. Is YXZ a XYZ?

Input


N M
AC_1,1 AC_1,2 ... AC_1,M
AC_2,1 AC_2,2 ... AC_2,M
.
.
.
AC_N,1 AC_N,2 ... AC_N,M

Output


P or NP.

Sample


Input
1 1
1
Output
NP

All Accepted, Perfect. But NP.

Input
10 3
111
110
110
111
111
111
100
000
111
111
Output
P

Yes.

Submit


Go (1.14)