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
import collections, heapq, bisect, math
 
def gcd(a, b):
    if b == 0: return a
    return gcd(b, a%b)
 
def solve(A, K):
    mod = 1000000
    nodes = {0 : [set(), 0, []]}
 
    for a in A:
        count = 0
        last_val = mod
        while last_val != 0:
            if a not in nodes: nodes[a] = [{last_val}, 1, [-count]]
            else:        
                nodes[a][0].add(last_val)
                nodes[a][1] += 1
                if len(nodes[a][2]) == K: heapq.heappushpop(nodes[a][2], -count)
                else: heapq.heappush(nodes[a][2], -count) 
            count += 1
            last_val = a
            a //= 2
 
    for node in nodes: nodes[node][2] = -sum(nodes[node][2])
    best_node = 0
    states = {0}
    while states:
        new_states = set()
 
        for node in states:
            if node == mod: continue
            if nodes[node][1] >= K:
                new_states |= nodes[node][0]
                if nodes[node][2] < nodes[best_node][2]: best_node = node
        states = new_states
    return nodes[best_node][2]
    
 
 
n, k = input().split(' ')
tests = []
for test in range(1):
    #n = input()
    tests.append([int(p) for p in input().split(' ')])
for test in tests: print(solve(test,int(k)))
#print(solve(n,b))