P5975 [CEOI 2009] photo

There are several points on the plane. Now you need to cover all points using the minimum number of rectangles whose base lies on the $X$ axis and whose area is less than or equal to $A$. These rectangles may overlap. The vertices of the rectangles do not have to be lattice points.

The first line contains two integers $N, A$. The next $N$ lines contain the coordinates of the points.

Output the minimum number of rectangles.

For $100\%$ of the testdata, $1 \le N \le 100$, $1 \le A \le 2 \times 10^6$. The coordinate range is within $[0, 100000]$. ------ ## Sample Explanation:  Translated by ChatGPT 5