P10289 [AtCoder] AtCoder Beginner Contest 061 - Big Array
普及
题目描述

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

输入格式

见题面

输出格式

见题面

样例输入
3 4 1 1 2 2 3 3
样例输出
3