Vasylko is excited about the game "Wormix" and has progressed to a level where he can unlock a boss fight. To do so, he needs to accumulate at least points from missions. There are a total of missions available, each with a known duration and point value. Vasylko is a skilled player and can complete any mission with ease.
However, he doesn't have enough time to complete all the missions, but he is eager to unlock the boss fight. Therefore, he wants to determine the minimum amount of time required to earn at least points.
The first line contains two integers and (1 \le N \le 100 – the number of missions, 0 \le K \le 10000 – the number of points needed to unlock the boss fight). The following lines each contain two integers: a_i – the points awarded for completing the -th mission, and t_i – the time required to complete it, with 0 < a_i, t_i \le 100.
Output the minimum time in which Vasylko can earn at least points, or if it is not possible.
Example 1