The game of three-dimensional chess is played on a cubic board of size N \times N \times N. A three-dimensional rook can move any number of squares in a straight line along any of the six directions (in either direction along any of the three axes).
On this board, rooks are placed. Your task is to write a program that determines whether these rooks cover the entire board.
The first line contains a natural number (1 \leq N \leq 1000) representing the size of the cube, and a number (0 \leq K \leq 10^6) representing the number of rooks. Each of the next lines contains three numbers, specifying the coordinates of a rook (each coordinate is a natural number from to ).
Print YES if the rooks cover the entire cube. Otherwise, print NO on the first line, and on the second line print the coordinates of any cell that is not covered by any rook.
Example 1