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:
/* package codechef; // don't place package name! */

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


/* Name of the class has to be "Main" only if the class is public. */
public class Codechef
{
         static class Input {
        private StringTokenizer tokenizer = null;
        private BufferedReader reader;
 
        public Input(InputStream inputStream) {
            reader = new BufferedReader(new InputStreamReader(inputStream));
        }
 
        public String nextLine() {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException();
            }
        }
 
        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                tokenizer = new StringTokenizer(nextLine());
            }
            return tokenizer.nextToken();
        }
 
        public int nextInt() {
            return Integer.parseInt(next());
        }
 
        public long nextLong() {
            return Long.parseLong(next());
        }
 
        public int[] nextIntArray(int n, int add) {
            int[] result = new int[n];
            for (int i = 0; i < n; i++) {
                result[i] = nextInt() + add;
            }
            return result;
        }
 
        public long[] nextLongArray(int n, long add) {
            long[] result = new long[n];
            for (int i = 0; i < n; i++) {
                result[i] = nextLong() + add;
            }
            return result;
        }
 
        public int[] nextIntArray(int n) {
            return nextIntArray(n, 0);
        }
 
    }
    
	public static void main (String[] args) throws java.lang.Exception
	{
		Input s=new Input(System.in);
		int t=1;
		PrintWriter out=new PrintWriter(System.out);
		
		while(t-->0)
		{
		    int n=s.nextInt();
		    int k=s.nextInt();
		    int a[]=new int[n];
		    ArrayList<Integer> b[]=new ArrayList[200001];
		    int ca[]=new int[200001]; 
		    for(int i=0;i<n;i++)
		    {a[i]=s.nextInt();
		    }
		    for(int i=0;i<200001;i++)
		    b[i]=new ArrayList<>();
		  
		  
		    int min=Integer.MAX_VALUE;
		    for(int i=0;i<n;i++)
		    {
		        int c=a[i];
		        ca[c]++;
		        b[c].add(0);
		        c=c>>1;
		        int cnt=1;
		        while(c>0)
		        {
		              b[c].add(cnt);
		                ca[c]++;
		            
		            cnt++;
		            c=(c>>1);
		        }
		    }
		    //System.out.println(hs.get(3));
		   
		   for(int i=0;i<200001;i++)
		       if(ca[i]>=k)
		       {
		           Collections.sort(b[i]);
		           int sum=0;
		           for(int j=0;j<k;j++)
		           sum+=b[i].get(j);
		           min=Math.min(sum,min);
		       }
		   
		   
		   
		   System.out.println(min);
		   
		    
		}
	}
}