Problem: 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

Solution (in JAVA):

Solution:

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.StringTokenizer;

public class Equa {

	static class FastReader { 
		BufferedReader br; 
		StringTokenizer st; 

		public FastReader() 
		{ 
			br = new BufferedReader(new
					InputStreamReader(System.in)); 
		} 

		String next() 
		{ 
			while (st == null || !st.hasMoreElements()) 
			{ 
				try
				{ 
					st = new StringTokenizer(br.readLine()); 
				} 
				catch (IOException  e) 
				{ 
					e.printStackTrace(); 
				} 
			} 
			return st.nextToken(); 
		} 

		int nextInt() 
		{ 
			return Integer.parseInt(next()); 
		} 

		long nextLong() 
		{ 
			return Long.parseLong(next()); 
		} 

		double nextDouble() 
		{ 
			return Double.parseDouble(next()); 
		} 

		String nextLine() 
		{ 
			String str = ""; 
			try
			{ 
				str = br.readLine(); 
			} 
			catch (IOException e) 
			{ 
				e.printStackTrace(); 
			} 
			return str; 
		} 
	}
	
	public static void main(String[] args) {
		
		FastReader sc = new FastReader();
	    OutputStream outputstream = System.out;
	    PrintWriter out = new PrintWriter(outputstream);
	    
	    int n = sc.nextInt();
	    int k = sc.nextInt();
//	    int[] arr = new int[n];
//	    for(int i = 0; i < n; i++) arr[i] = sc.nextInt();
	    ArrayList<Integer>[] nmbs = new ArrayList[200001];
	    for(int i = 0; i < nmbs.length; i++) {
	    	nmbs[i] = new ArrayList();
	    }
	    for(int i = 0; i < n; i++) {
	    	int now = sc.nextInt();
	    	int cnt = 0;
	    	while(now>0) {
	    		nmbs[now].add(cnt++);
	    		now >>= 1;
	    	}
	    }
	    int ans = (int)1e9;
	    for(int i = 0; i < nmbs.length; i++) {
	    	int tmp = 0;
	    	if(nmbs[i].size()<k) continue;
	    	Collections.sort(nmbs[i]);
	    	for(int j = 0; j < k; j++) tmp +=  nmbs[i].get(j);
	    	ans = Math.min(ans, tmp);
	    }
	    out.println(ans);
	    out.close();
	}

}