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
///package main;

import java.io.*;
import java.util.*;

public final class Main {
    Scanner sc;

    public static void main(String[] args) throws Exception {
        new Main().run();
    }
    
    {
        sc = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
    }
    
    void run() {
        int n = sc.nextInt();
        int k = sc.nextInt();
        int[][] a = new int[30][n];
        for(int i=0; i<n; i++)
            a[0][i] = sc.nextInt();
        
        for(int row=1; row<30; row++) {
            for(int col=0; col<n; col++) {
                if(a[row - 1][col] == 0) {
                    a[row][col] = -1;
                } else {
                    a[row][col] = a[row - 1][col] / 2;
                }
            }
        }
        
        int[] count = new int[200005];
        int[] costs = new int[200005];
        for(int i=0; i<30; i++) {
            for(int j=0; j<n; j++) {
                if(a[i][j] == -1)
                    continue;
                if(count[a[i][j]] == k)
                    continue;
                count[a[i][j]]++;
                costs[a[i][j]] += i;
            }
        }
        
        int min = Integer.MAX_VALUE;
        for(int i=0; i<count.length; i++) {
            if(count[i] == k) {
                min = Math.min(min, costs[i]);
            }
        }
        
        System.out.println(min);
    }
}