Problem: You have a Petri dish with bacteria and you are preparing to dive into the harsh micro-world. But, unfortunately, you don't have any microscope nearby, so you can't watch them.
You know that you have bacteria in the Petri dish and size of the -th bacteria is . Also you know intergalactic positive integer constant .
The -th bacteria can swallow the -th bacteria if and only if and . The -th bacteria disappear, but the -th bacteria doesn't change its size. The bacteria can perform multiple swallows. On each swallow operation any bacteria can swallow any bacteria if and . The swallow operations go one after another.
For example, the sequence of bacteria sizes and . The one of possible sequences of swallows is: . In total there are bacteria remained in the Petri dish.
Since you don't have a microscope, you can only guess, what the minimal possible number of bacteria can remain in your Petri dish when you finally will find any microscope.
Input Format: The first line contains two space separated positive integers and (, ) — number of bacteria and intergalactic constant .
The second line contains space separated integers () — sizes of bacteria you have.
Output Format: Print the only integer — minimal possible number of bacteria can remain.
Note: The first example is clarified in the problem statement.
In the second example an optimal possible sequence of swallows is: .
In the third example no bacteria can swallow any other bacteria.