A programming competition site AtCode provides algorithmic problems. Each problem is allocated a score based on its difficulty. Currently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points. These p_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 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (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 G or more points. At least how many problems does he need to solve for this objective?

Constraints

* 1 ≤ D ≤ 10
* 1 ≤ p_i ≤ 100
* 100 ≤ c_i ≤ 10^6
* 100 ≤ G
* All values in input are integers.
* c_i and G are all multiples of 100.
* It is possible to have a total score of G or more points.

Input

Input is given from Standard Input in the following format:


D G
p_1 c_1
:
p_D c_D


Output

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

Examples

Input

2 700
3 500
5 800


Output

3


Input

2 2000
3 500
5 800


Output

7


Input

2 400
3 500
5 800


Output

2


Input

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


Output

66
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int d = sc.nextInt();
        int g = sc.nextInt();
        List<Integer> p = new ArrayList<>();
        List<Integer> c = new ArrayList<>();
        for (int i = 0; i < d; i++) {
            p.add(sc.nextInt());
            c.add(sc.nextInt());
        }

        int minProgram = Integer.MAX_VALUE;
        for (int i = 0; i < Math.pow(2, d); i++) {
            int score = 0;
            int program = 0;
            // 完全に解く問題と全く解かない問題を決定
            for (int j = 0; j <= d; j++) {
                if (((i >> j) & 1) == 1) {
                    score += 100 * (j + 1) * p.get(j) + c.get(j);
                    program += p.get(j);
                }
            }
            // スコアがGより小さい場合、中途半端に解く問題が必要になる
            // 解いてない問題のうち、もっとも高い配点の問題を加点する
            if (score < g) {
                for (int j = d - 1; j >= 0; j--) {
                    if (((i >> j) & 1) == 1) {
                        continue;
                    }
                    for (int k = 0; k < p.get(j) - 1; k++) {
                        score += 100 * (j + 1);
                        program++;
                        if (score >= g) {
                            break;
                        }
                    }
                    break;
                }
            }
            if (score >= g && program < minProgram) {
                minProgram = program;
            }
        }
        System.out.println(minProgram);
    }

}
