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. \InputFile The first line contains two numbers $n~(1 \le n \le 10^5)$ and $k~(1 \le k \le n)$. Second line contains $n$ integers $p_i~(1 \le p_i \le 10^5)$ --- the original ship destinations. \OutputFile Print the minimum number of changes.