B"On a chessboard with a width of 10^9 and a height of 10^9 , the rows are numbered from bottom to top from 1 to 10^9 , and the columns are numbered from left to right from 1 to 10^9 . Therefore, for each cell of the chessboard you can assign the coordinates (x,y) , where x is the column number and y is the row number. Every day there are fights between black and white pieces on this board. Today, the black ones won, but at what price? Only the rook survived, and it was driven into the lower left corner -- a cell with coordinates (1,1) . But it is still happy, because the victory has been won and it's time to celebrate it! In order to do this, the rook needs to go home, namely -- on the upper side of the field (that is, in any cell that is in the row with number 10^9 ). Everything would have been fine, but the treacherous white figures put spells on some places of the field before the end of the game. There are two types of spells: Let's recall that the rook is a chess piece that in one move can move to any point that is in the same row or column with its initial position. In our task, the rook can move from the cell (r_0,c_0) into the cell (r_1,c_1) only under the condition that r_1 = r_0 or c_1 = c_0 and there is no blocking lines or blocking segments between these cells (For better understanding, look at the samples). Fortunately, the rook can remove spells, but for this it has to put tremendous efforts, therefore, it wants to remove the minimum possible number of spells in such way, that after this it can return home. Find this number! The first line contains two integers n and m ( 0 <= n,m <= 10^5 ) -- the number of vertical and horizontal spells. Each of the following n lines contains one integer x ( 1 <= x < 10^9 ) -- the description of the vertical spell. It will create a blocking line between the columns of x and x"...