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
import bisect

def k_equal(arr, take, n):
    arr.sort()
    presum = [0] * (n+1)
    postsum = [0] * (n+1)

    for i in range(n):
        presum[i+1] = presum[i] + arr[i]

    for i in range(n-1, -1, -1):
        postsum[i] = postsum[i+1] + arr[i]

    #print(arr)
    #print(presum)
    #print(postsum)
    
    left = right = 0
    ans = float('inf')
    while right < n:
        while right < n and arr[left] == arr[right]:
            right += 1

        if right - left >= take:
            return 0

        #print(left, right)

        pre_step = left * arr[left] - presum[left]
        post_step = postsum[right] - (n-right) * arr[left]
        need = take - right + left
        #print(f"use: {arr[left]}, left: {left}, right: {n-right}, need: {need}")
        #print(f"prestep: {left} * {arr[left]} - {presum[left]} = {pre_step}")
        #print(f"poststep: {postsum[right]} - {n-right} * {arr[left]} = {post_step}")
        #print(f"{pre_step} + {post_step} - {(left + n- right - need)} = {pre_step+post_step-(left + n- right - need)}")
        ans = min(ans, pre_step + post_step - (left + n- right - need))
        if left >= need:
            ans = min(ans, pre_step - (left - need))
            #print(f"left: {pre_step - (left - need)}")
        if (n-right) >= need:
            ans = min(ans, post_step - (n - right - need))
            #print(f"right: {post_step - (n - right - need)}")
        #print(f"ans: {ans}")
        left = right
    
    return ans


length, eq = [int(s) for s in input().split(" ")]  # read a list of integers, 2 in this case
arr = [int(s) for s in input().split(" ")]  # read a list of integers, 2 in this case
h = k_equal(arr, eq, length)
print(h)

#t = int(input())  # read a line with a single integer
#for i in range(1, t + 1):
#    length, eq = [int(s) for s in input().split(" ")]  # read a list of integers, 2 in this case
#    arr = [int(s) for s in input().split(" ")]  # read a list of integers, 2 in this case
#    h = k_equal(arr, eq, length)
#    print("Case #{}: {}".format(i, h))

