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.TreeSet;
import java.util.Scanner;
import java.util.Iterator;

class Elem implements Comparable<Elem> {
	public int a_, n_, idx_;
	public Elem (int a, int n, int idx) {
		a_ = a;
		n_ = n;
		idx_ = idx;
	}
	public int compareTo (Elem o) {
		if (a_ != o.a_)
			return a_ - o.a_;
		return idx_ - o.idx_;
	}
}

public class Main {

	public static void main (String[] args) {
		int N;
		long K;
		Scanner sc = new Scanner (System.in);
		N = sc.nextInt ();
		K = sc.nextLong ();
		TreeSet<Elem> set = new TreeSet<Elem> ();
		for (int i=0; i<N; i++) {
			int a = sc.nextInt ();
			int b = sc.nextInt ();
			set.add (new Elem (a, b, i));
		}
		Iterator<Elem> iter = set.iterator ();
		long sum = 0;
		while (iter.hasNext ()) {
			Elem e = iter.next ();
			sum += e.n_;
			if (sum>=K) {
				System.out.println (e.a_);
				break;
			}
		}
	}
}