Problem: This problem consists of three subproblems: for solving subproblem C1 you will receive 4 points, for solving subproblem C2 you will receive 4 points, and for solving subproblem C3 you will receive 8 points.

Manao decided to pursue a fighter's career. He decided to begin with an ongoing tournament. Before Manao joined, there were n contestants in the tournament, numbered from 1 to n. Each of them had already obtained some amount of tournament points, namely the i-th fighter had pi points.

Manao is going to engage in a single fight against each contestant. Each of Manao's fights ends in either a win or a loss. A win grants Manao one point, and a loss grants Manao's opponent one point. For each i, Manao estimated the amount of effort ei he needs to invest to win against the i-th contestant. Losing a fight costs no effort.

After Manao finishes all of his fights, the ranklist will be determined, with 1 being the best rank and n + 1 being the worst. The contestants will be ranked in descending order of their tournament points. The contestants with the same number of points as Manao will be ranked better than him if they won the match against him and worse otherwise. The exact mechanism of breaking ties for other fighters is not relevant here.

Manao's objective is to have rank k or better. Determine the minimum total amount of effort he needs to invest in order to fulfill this goal, if it is possible.

Input

The first line contains a pair of integers n and k (1 ≤ k ≤ n + 1). The i-th of the following n lines contains two integers separated by a single space — pi and ei (0 ≤ pi, ei ≤ 200000).

The problem consists of three subproblems. The subproblems have different constraints on the input. You will get some score for the correct submission of the subproblem. The description of the subproblems follows.

  * In subproblem C1 (4 points), the constraint 1 ≤ n ≤ 15 will hold. 
  * In subproblem C2 (4 points), the constraint 1 ≤ n ≤ 100 will hold. 
  * In subproblem C3 (8 points), the constraint 1 ≤ n ≤ 200000 will hold. 

Output

Print a single number in a single line — the minimum amount of effort Manao needs to use to rank in the top k. If no amount of effort can earn Manao such a rank, output number -1.

Examples

Input

3 2
1 1
1 4
2 2


Output

3


Input

2 1
3 2
4 0


Output

-1


Input

5 2
2 10
2 10
1 1
3 1
3 1


Output

12

Note

Consider the first test case. At the time when Manao joins the tournament, there are three fighters. The first of them has 1 tournament point and the victory against him requires 1 unit of effort. The second contestant also has 1 tournament point, but Manao needs 4 units of effort to defeat him. The third contestant has 2 points and victory against him costs Manao 2 units of effort. Manao's goal is top be in top 2. The optimal decision is to win against fighters 1 and 3, after which Manao, fighter 2, and fighter 3 will all have 2 points. Manao will rank better than fighter 3 and worse than fighter 2, thus finishing in second place.

Consider the second test case. Even if Manao wins against both opponents, he will still rank third.

Solution (in JAVA):

Solution:


import java.util.*; //Scanner;
import java.io.PrintWriter; //PrintWriter

public class R229_Rocket_C1 //Name: The Tournament
{
	public static void main(String[] args) {
		Scanner      in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		solve(in, out);
		out.close();
		in.close();	
	}
	
	public static void solve(Scanner in, PrintWriter out)
	{
		int n = in.nextInt();	
		int k = in.nextInt();
		
		int[] p = new int[n];
		int[] e = new int[n];
		for (int i = 0; i < n; i++) 
		{
			p[i] = in.nextInt();
			e[i] = in.nextInt();
		}
		
		int minEffort = Integer.MAX_VALUE;
		for (int bitmask = 0; bitmask < 1<<n; bitmask++) //2^n
		{
			int win = 0, effort = 0;
			int[] p2 = new int[n];
			boolean[] won = new boolean[n];
			for (int i = 0; i < n; i++) p2[i] = p[i];
			for (int j = 0; j < n; j++)
				if ((bitmask & (1 << j)) != 0) //win
				{
					win++;
					effort += e[j];
					won[j] = true;
				}
				else //lose
				{		
					p2[j]++;
				}
	        
			Arrays.sort(p2);
			int place = n+1;
			int i = 0;
			while (i < n && p2[i] < win)
			{
				i++; place--; 
			}
			
			if (i < n && p2[i] == win)
			{
				for (int j = 0; j < n; j++)
					if (p[j]==win && won[j]) place--;
			}
		
			if (place <= k)
				minEffort = Math.min(minEffort,  effort);

		}
		if (minEffort == Integer.MAX_VALUE)
			out.println(-1);
		else
			out.println(minEffort);	
	}
}