Problem: There is an empty array. The following N operations will be performed to insert integers into the array. In the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array. Find the K-th smallest integer in the array after the N operations. For example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.

Constraints

* 1≤N≤10^5
* 1≤a_i,b_i≤10^5
* 1≤K≤b_1…+…b_n
* All input values are integers.

Input

Input is given from Standard Input in the following format:


N K
a_1 b_1
:
a_N b_N


Output

Print the K-th smallest integer in the array after the N operations.

Examples

Input

3 4
1 1
2 2
3 3


Output

3


Input

10 500000
1 100000
1 100000
1 100000
1 100000
1 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000


Output

1

Solution (in JAVA):

Solution:
import java.util.*;
// warm-up
public class Main {

	static void solve() {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt(), n=N, m=100000;
		double K = sc.nextDouble();
		double[] cnt = new double[m+1];
		while (n-->0) {
			int b = sc.nextInt(), c = sc.nextInt();
			cnt[b]+=c;
		}
		for (int ans = 1; ans<=m; ans++) {
			if (K<=cnt[ans]) {
				System.out.println(ans);
				System.exit(0);
			}
			K-=cnt[ans];
		}
		sc.close();		
	}

	public static void main(String args[]) {
		solve();
	}

}