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

class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long n=sc.nextLong(),k=sc.nextLong();
		HashMap<Long,Long> hm=new HashMap<Long,Long>();
		long[] h=new long[(int)n];
		long ite=0;
		for(int i=0;i<n;i++){
			long a=sc.nextLong();
			long buf=sc.nextLong();
			if(hm.containsKey(a)){
				hm.put(a, hm.get(a)+buf);
			//	System.out.println(a+" "+hm.get(a));
			}else{
				h[(int)ite]=a;
			//	System.out.println("h["+ite+"]="+h[ite]);
				ite++;
				hm.put(a, buf);
			//	System.out.println(a+" "+hm.get(a));
			}
		}
		for(int z=0;z<n;z++){
		//	System.out.print(h[z]+" ");
		}
		Arrays.sort(h);
		for(int z=0;z<n;z++){
		//	System.out.print(h[z]+" ");
		}
		int i=0;
		while(h[i]==0){
		//	System.out.println("h["+i+"]="+h[i]);
			i++;
		}
		while(k>0&&i<n){
		//	System.out.println(i);
			k-=hm.get(h[i]);
			i++;
		//	System.out.println(k);
		}
		System.out.println(h[--i]);
	}
}
