B'You have a square chessboard of size n x n . Rows are numbered from top to bottom with numbers from 1 to n , and columns -- from left to right with numbers from 1 to n . So, each cell is denoted with pair of integers (x, y) ( 1 <= x, y <= n ), where x is a row number and y is a column number. You have to perform q queries of three types: Subrectangle is a set of cells (x, y) such that for each cell two conditions are satisfied: x_1 <= x <= x_2 and y_1 <= y <= y_2 . Recall that cell (a, b) is attacked by a rook placed in cell (c, d) if either a = c or b = d . In particular, the cell containing a rook is attacked by this rook. The first line contains two integers n and q ( 1 <= n <= 10^5 , 1 <= q <= 2 cdot 10^5 ) -- the size of the chessboard and the number of queries, respectively. Each of the following q lines contains description of a query. Description begins with integer t ( t in {1, 2, 3 } ) which denotes type of a query: It 's guaranteed that among q queries there is at least one query of the third type. Print the answer for each query of the third type in a separate line. Print "Yes" (without quotes) if each cell of the subrectangle is attacked by at least one rook. Otherwise print "No" (without quotes). Consider example. After the first two queries the board will look like the following picture (the letter R denotes cells in which rooks are located, the subrectangle of the query of the third type is highlighted in green): Chessboard after performing the third and the fourth queries: Chessboard after performing the fifth and the sixth queries: Chessboard after performing the seventh and the eighth queries: Chessboard after performing the last two queries: '...