Problem

Find the maximum number of towers that will receive the signal.

Input

The first line contains two integers, N, denoting the number of towers, and K, denoting the maximum number of changes. The second line contains N space-separated integers, denoting the frequency of the receiver of each tower.

Output

The maximum number of towers that will receive the signal.

Constraints

• 1 <= N <= 100
• 1 <= K <= 50
• 1 <= fi <= 1000000

Example

N = 5 K = 2 frequencies = [10, 10, 30, 40, 30]

Note

Initially, Alex can choose any signal frequency and transmit it.