Master Zhu and Chessboard

Master Zhu has a rectangular board consisting of $N$ rows and $M$ columns. In the $i$-th row, the squares from the column $L\_i$ to the column $R\_i$ inclusive are colored black, and all other squares are colored white. Additionally, it is known that $L\_i \le L\_{i + 1}$ and $R\_i \le R\_{i + 1}$. Now Master Zhu is going to place some chess pieces on several black squares so that for each black square, there is at least one chess piece in its row or in its column.

Find the minimum number of chess pieces he should place.

The first line of the input contains two integers $N$ and $M$: the number of rows and columns $(1 \le N, M \le 100)$. Each of the next $N$ lines contains two integers $L\_i$ and $R\_i$ ($1 \le L\_i \le R\_i \le M$). It is guaranteed that $L\_i \le L\_{i + 1}$ and $R\_i \le R\_{i + 1}$.

Output the minimum number of chess pieces Master Zhu should place.