# SpaceX

Easy

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

Elon Musk plans to send his spaceships to $k$ different planets. To do this, he has $n$ spaceships. Initially, it is known where each ship will be sent. The planets are numbered from $1$ to $10_{9}$. As SpaceX’s chief space engineer, you are entitled to change the destination of any ship. For the minimum number of changes you need to make sure that all ships are sent to $k$ different planets.

## Input

The first line contains two numbers $n(1≤n≤10_{5})$ and $k(1≤k≤n)$. Second line contains $n$ integers $p_{i}(1≤p_{i}≤10_{5})$ — the original ship destinations.

## Output

Print the minimum number of changes.

## Examples

Input #1

Answer #1

Input #2

Answer #2

Submissions 2K

Acceptance rate 25%