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.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
	
	public static void main(String[] args)
	{
		Scanner s=new Scanner(System.in);
		
		int n=s.nextInt();
		int k=s.nextInt();
		
		Integer[] arr=new Integer[n];
		
		for(int i=0;i<n;i++)
		{
			arr[i]=s.nextInt();
		}
		
		Arrays.sort(arr);
		
		Map<Integer,Integer> map=new HashMap<Integer,Integer>();
		
		Map<Integer,Integer>[] brr=new HashMap[n];
		
		for(int i=0;i<n;i++)
		{
			Map<Integer,Integer> ma=new HashMap<Integer,Integer>();
			
			brr[i]=ma;
			
			int count=0;
			
			while(arr[i]>0)
			{
				brr[i].put(arr[i],count);
				
				if(!map.containsKey(arr[i]))
				{
					map.put(arr[i],1);
				}
				
				count++;
				arr[i]=arr[i]/2;
			}
			
			brr[i].put(0,count);
			
			if(!map.containsKey(arr[i]))
			{
				map.put(arr[i],1);
			}
			
		}
		
		int min=Integer.MAX_VALUE;
		
		for(Map.Entry<Integer,Integer> entry: map.entrySet())
		{
			int check=entry.getKey();
			//System.out.println(check);
			
			int count=0;
			
			int temp=0;
			
			for(int i=0;i<n;i++)
			{
				if(brr[i].containsKey(check))
				{
					temp=temp+brr[i].get(check);
					count++;
				}
				if(count==k)
					break;
			}
			
			if(count==k&&min>temp)
				min=temp;
		}
		
		System.out.println(min);
		
	}
	
}