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.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.Comparator;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.stream.Collectors;


public class D{
	
	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; 
        } 
    }
	static int l,r;
	static long sum = 0L;
	static void maxSum(long a[])
	{
		long max_so_far = Long.MIN_VALUE, 
		        max_ending_here = 0;
		int start = 0, end = 0, s = 0; 
		int size = a.length; 
		        for (int i = 0; i < size; i++)  
		        { 
		            max_ending_here += a[i]; 
		  
		            if (max_so_far < max_ending_here)  
		            { 
		                max_so_far = max_ending_here; 
		                start = s; 
		                end = i; 
		            } 
		  
		            if (max_ending_here < 0)  
		            { 
		                max_ending_here = 0; 
		                s = i + 1; 
		            } 
		        }
		        if(max_so_far > 0)
		        {
		        	l = start;
		        	r = end;
		        }
		        else
		        {
		        	l = -1;
		        	r = -1;
		        }
		        sum = max_so_far;
	}
	
	static class Pair
	{
		int a;
		int b;
		Pair(int a,int b)
		{
			this.a = a;
			this.b = b;
		}
	}
	
	static long mod;
	static long fact(long n)
	{	
		long f = 1L;
		
		for(long i = 2; i <= n; i++)
		{
			f = (f*i)%mod;
		}
		return f;
	}
	public static void main(String[] args) 
	{
		OutputStream outputStream = System.out;
        FastReader sc = new FastReader();
        PrintWriter out = new PrintWriter(outputStream);
        
        int len = 1000000;
        int n = sc.nextInt();
        int k = sc.nextInt();
        
        int a[] = new int[n];
        
        int map[] = new int[len];
        int sum[] = new int[len];
        for(int i = 0; i < n; i++)
        {
        	a[i] = sc.nextInt();
        }
        
        Arrays.sort(a);
        
        for(int i = 0; i < n; i++)
        {
        	int cp = a[i];
        	int count = 0;
        	while(cp != 0)
        	{
        		if(map[cp] < k)
        		{
        			map[cp]++;
        			sum[cp] += count;
        		}
        		count++;
        		cp /= 2;
        	}
        }
        
        int min = Integer.MAX_VALUE;
        for(int i = 1; i < len; i++)
        {
        	if(map[i] == k)
        	{
        		min = Math.min(sum[i],min);
        	}
        }
        out.println(min);
        out.close();
	}

}
