You are given the array a consisting of n elements and the integer k ≤ n.

You want to obtain at least k equal elements in the array a. In one move, you can make one of the following two operations:

  * Take one of the minimum elements of the array and increase its value by one (more formally, if the minimum value of a is mn then you choose such index i that a_i = mn and set a_i := a_i + 1); 
  * take one of the maximum elements of the array and decrease its value by one (more formally, if the maximum value of a is mx then you choose such index i that a_i = mx and set a_i := a_i - 1). 



Your task is to calculate the minimum number of moves required to obtain at least k equal elements in the array.

Input

The first line of the input contains two integers n and k (1 ≤ k ≤ n ≤ 2 ⋅ 10^5) — the number of elements in a and the required number of equal elements.

The second line of the input contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9), where a_i is the i-th element of a.

Output

Print one integer — the minimum number of moves required to obtain at least k equal elements in the array.

Examples

Input


6 5
1 2 2 4 2 3


Output


3


Input


7 5
3 3 2 1 1 1 3


Output


4
def I():
    return int(input())
def IS():
    return  input()
def IL():
    return list(map(int,input().split()))
def IM():
    return map(int,input().split())
n,k=IM() 
l=IL() 
from collections import Counter
c=Counter(l)
if max(c.values())>=k:
    print(0)
    exit() 
l.sort() 
from collections import defaultdict 
d=defaultdict(list)
for i in range(n):
    curr=l[i]
    while curr:
        d[(l[i],i)].append(curr)
        curr//=2 
    d[(l[i],i)].append(0)
mini=10**9 
def check(i):
    to_make=i 
    tot=[] 
    for j in range(n):
        if i not in d[(l[j],j)]:
            pass 
        else:
            tot.append(d[(l[j],j)].index(i))
    if len(tot)<k:
        return 10**9
    else:
        tot.sort()
        return sum(tot[:k])
d1=defaultdict(int)
for i in d:
    a=d[i]
    for a1 in a:
        d1[a1]+=1 
cand=[i for i in d1 if d1[i]>=k]
#print(cand)
for i in l:
    mini=min(mini,check(i))
for i in range(1000):
    mini=min(mini,check(i))
for i in cand:
    mini=min(mini,check(i))
print(mini)
