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.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

public class Main 
{
	static class Reader
	{
		BufferedReader br;
		StringTokenizer st;
		public Reader()
		{
			br = new BufferedReader(new InputStreamReader(System.in));
		}
		public String next() throws IOException
		{
			if(st == null || !st.hasMoreElements())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
			
		}
		public Integer nextInt() throws IOException
		{
			return Integer.parseInt(next());
		}
		public Long nextLong() throws NumberFormatException, IOException
		{
			return Long.parseLong(next());
		}
	}
	static class Writer
	{
		BufferedWriter bw;
		public Writer()
		{
			bw = new BufferedWriter(new OutputStreamWriter(System.out));
		}
		public void write(char c) throws IOException
		{
			bw.write(c);
		}
		public void writeInt(Integer x, boolean endLine) throws IOException
		{
			bw.write(Integer.toString(x) + (endLine ? '\n' : ' '));
		}
		public void writeLong(Long x, boolean endLine) throws IOException
		{
			bw.write(Long.toString(x) + (endLine ? '\n' : ' '));
		}
		public void flush() throws IOException
		{
			bw.flush();
		}
	}
	static class Pair
	{
		public Integer first;
		public Integer second;
		public Pair() {first = 0; second = 0;}
		public Pair(Integer first, Integer second)
		{
			this.first = first;
			this.second = second;
		}
	}
	public static void main(String[] args) throws IOException 
	{
		Reader reader = new Reader();
		Writer writer = new Writer();
		int n, k;
		n = reader.nextInt();
		k = reader.nextInt();
		Integer[] a = new Integer[n];
		for(int i = 0 ; i < n ; i++)
		{
			a[i] = reader.nextInt();
		}
		Arrays.sort(a);
		HashMap<Integer, Pair> map = new HashMap<>();
		for(int i = 0 ; i < n ; i++)
		{
			int cost = 0;
			while(true)
			{
				Pair value = map.get(a[i]);
				if(value == null)
				{
					map.put(a[i], new Pair(cost, 1));
				}
				else if(value.second < k)
				{
					value.first += cost;
					value.second += 1;
				}
				if(a[i] == 0) break;
				a[i] >>= 1;
				++cost;
			}
			
		}
		int minCost = Integer.MAX_VALUE;
		for(Map.Entry<Integer, Pair> e : map.entrySet())
		{
			if(e.getValue().second == k)
				minCost = Math.min(minCost, e.getValue().first);
		}
		writer.writeInt(minCost, true);
		writer.flush();
	}
}