Competitions

# MAP data structure

# SpaceX

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`

. 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 ^{9}**k** different planets.

#### Input

The first line contains two numbers **n** (**1** ≤ **n** ≤ `10`

) and ^{5}**k** (**1** ≤ **k** ≤ **n**). Second line contains **n** integers `p`

(_{i}**1** ≤ `p`

≤ _{i}`10`

) - the original ship destinations. ^{5}

#### Output

Print the minimum number of changes.

Input example #1

3 1 1 5 3

Output example #1

2

Input example #2

5 4 10 1 2 1 10

Output example #2

1