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
from heapq import *
from collections import *
import sys

sys.setrecursionlimit(10 ** 5)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    n,k=MI()
    cnt=Counter(LI())
    aa=[]
    cc=[]
    for a,c in sorted(cnt.items()):
        aa.append(a)
        cc.append(c)
        if c>=k:
            print(0)
            exit()
    #print(aa)
    #print(cc)
    n=len(aa)
    cl=[0]*n
    sc=0
    sa=0
    for i in range(n):
        cl[i]=(aa[i]-1)*sc-sa
        sc+=cc[i]
        sa+=cc[i]*aa[i]
    #print(cl)

    cr=[0]*n
    sc=0
    sa=0
    for i in range(n-1,-1,-1):
        cr[i]=sa-(aa[i]+1)*sc
        sc+=cc[i]
        sa+=cc[i]*aa[i]
    #print(cr)

    ans=10**16
    s=0
    for i in range(n):
        s+=cc[i]
        if s<k:cur=cl[i]+cr[i]+k-cc[i]
        else:cur=cl[i]+k-cc[i]
        if cur<ans:ans=cur
        if s>=k:break
    s=0
    for i in range(n-1,-1,-1):
        s+=cc[i]
        if s<k:cur=cl[i]+cr[i]+k-cc[i]
        else:cur=cr[i]+k-cc[i]
        if cur<ans:ans=cur
        if s>=k:break
    print(max(ans,0))

main()
