Rating changes for last rounds are temporarily rolled back. They will be returned soon.
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Caisa and Sugar

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputCaisa is going to have a party and he needs to buy the ingredients for a big chocolate cake. For that he is going to the biggest supermarket in town.

Unfortunately, he has just *s* dollars for sugar. But that's not a reason to be sad, because there are *n* types of sugar in the supermarket, maybe he able to buy one. But that's not all. The supermarket has very unusual exchange politics: instead of cents the sellers give sweets to a buyer as a change. Of course, the number of given sweets always doesn't exceed 99, because each seller maximizes the number of dollars in the change (100 cents can be replaced with a dollar).

Caisa wants to buy only one type of sugar, also he wants to maximize the number of sweets in the change. What is the maximum number of sweets he can get? Note, that Caisa doesn't want to minimize the cost of the sugar, he only wants to get maximum number of sweets as change.

Input

The first line contains two space-separated integers *n*, *s* (1 ≤ *n*, *s* ≤ 100).

The *i*-th of the next *n* lines contains two integers *x*_{i}, *y*_{i} (1 ≤ *x*_{i} ≤ 100; 0 ≤ *y*_{i} < 100), where *x*_{i} represents the number of dollars and *y*_{i} the number of cents needed in order to buy the *i*-th type of sugar.

Output

Print a single integer representing the maximum number of sweets he can buy, or -1 if he can't buy any type of sugar.

Examples

Input

5 10

3 90

12 0

9 70

5 50

7 0

Output

50

Input

5 5

10 10

20 20

30 30

40 40

50 50

Output

-1

Note

In the first test sample Caisa can buy the fourth type of sugar, in such a case he will take 50 sweets as a change.

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/25/2022 14:55:44 (k3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|