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 java.util.*;
import java.io.*;

/*
ID: jamesou1
LANG: JAVA
PROB: equilize
*/

public class equilize {

	public static void main(String[] args) throws IOException {

		Scanner input = new Scanner(System.in);

		StringTokenizer tokens = new StringTokenizer(input.nextLine());
		int n = Integer.parseInt(tokens.nextToken());
		int k = Integer.parseInt(tokens.nextToken());
		
		int[] a = new int[n];
		tokens = new StringTokenizer(input.nextLine());
		for(int i = 0; i < n; i++) {
			a[i] = Integer.parseInt(tokens.nextToken());
		}
		
		Set<Integer> possibleNum = new HashSet<Integer>();
		for(int i = 0; i < n; i++) {
			for(int j = a[i]; j > 0; j/= 2) {
				possibleNum.add(j);
			}
		}
		
		int ans = Integer.MAX_VALUE;
		for(int num: possibleNum) {
			PriorityQueue<Integer> pq = new PriorityQueue<Integer>();
			for(int i = 0; i < n; i++) {
				int cnt = 0;
				int j = a[i];
				for(; j > num; j/= 2) {
					//System.out.print(j + " ");
					cnt++;
				} //System.out.println(":" + cnt + " " + j + " " + num);
				if(j == num)
					pq.add(cnt);
			}
			
			int total = 0;
			for(int i = 0; i < k; i++) {
				if(pq.isEmpty()) total = Integer.MAX_VALUE;
				else total+= pq.poll();
			}
			//System.out.println(total);
			ans = Math.min(ans, total);
		}
		
		System.out.println(ans);

		input.close();

	}

}

