#abc104c. [abc104_c]All Green

[abc104_c]All Green

Problem Statement

A programming competition site AtCode provides algorithmic problems. Each problem is allocated a score based on its difficulty. Currently, for each integer ii between 11 and DD (inclusive), there are pip_i problems with a score of 100i100i points. These p1++pDp_1 + … + p_D problems are all of the problems available on AtCode.

A user of AtCode has a value called total score. The total score of a user is the sum of the following two elements:

  • Base score: the sum of the scores of all problems solved by the user.
  • Perfect bonuses: when a user solves all problems with a score of 100i100i points, he/she earns the perfect bonus of cic_i points, aside from the base score (1iD)(1 ≤ i ≤ D).

Takahashi, who is the new user of AtCode, has not solved any problem. His objective is to have a total score of GG or more points. At least how many problems does he need to solve for this objective?

Constraints

  • 1D101 ≤ D ≤ 10
  • 1pi1001 ≤ p_i ≤ 100
  • 100ci106100 ≤ c_i ≤ 10^6
  • 100G100 ≤ G
  • All values in input are integers.
  • cic_i and GG are all multiples of 100100.
  • It is possible to have a total score of GG or more points.

Input

Input is given from Standard Input in the following format:

DD GG p1p_1 c1c_1 :: pDp_D cDc_D

Output

Print the minimum number of problems that needs to be solved in order to have a total score of GG or more points. Note that this objective is always achievable (see Constraints).


Sample Input 1

2 700
3 500
5 800

Sample Output 1

3

In this case, there are three problems each with 100100 points and five problems each with 200200 points. The perfect bonus for solving all the 100100-point problems is 500500 points, and the perfect bonus for solving all the 200200-point problems is 800800 points. Takahashi's objective is to have a total score of 700700 points or more.

One way to achieve this objective is to solve four 200200-point problems and earn a base score of 800800 points. However, if we solve three 100100-point problems, we can earn the perfect bonus of 500500 points in addition to the base score of 300300 points, for a total score of 800800 points, and we can achieve the objective with fewer problems.


Sample Input 2

2 2000
3 500
5 800

Sample Output 2

7

This case is similar to Sample Input 1, but the Takahashi's objective this time is 20002000 points or more. In this case, we inevitably need to solve all five 200200-point problems, and by solving two 100100-point problems additionally we have the total score of 20002000 points.


Sample Input 3

2 400
3 500
5 800

Sample Output 3

2

This case is again similar to Sample Input 1, but the Takahashi's objective this time is 400400 points or more. In this case, we only need to solve two 200200-point problems to achieve the objective.


Sample Input 4

5 25000
20 1000
40 1000
50 1000
30 1000
1 1000

Sample Output 4

66

There is only one 500500-point problem, but the perfect bonus can be earned even in such a case.