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.*;

import static java.lang.System.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int D = sc.nextInt();
        int G = sc.nextInt();

        int[] p = new int[D];
        int[] c = new int[D];
        for (int i = 0; i < D; i++) {
            p[i] = sc.nextInt();
            c[i] = sc.nextInt();
        }

        // 完全に解く or 中途半端に解くしかない。その組み合わせの中で最も解く問題数が少ないものを探す
        // 完全に解くものの組み合わせをリストアップ
        int ans = Integer.MAX_VALUE;
        for(int i = 0; i < 1<<D; i++){
            int ans_tmp = 0;
            int score = 0;

            // 完全に解くものの合計
            for(int j = 0; j < D; j++){
                if((i>>j & 1) == 1){
                    score += 100 * (j + 1) * p[j] + c[j];
                    ans_tmp += p[j];
                }
                // スコア超えたらそこで終わり
                if(score >= G){
                    ans = Math.min(ans, ans_tmp);
                    continue;
                }
            }

            // 中途半端に解くものを探す
            for(int j = 0; j < D; j++){
                // 完全に解かれているものはスキップ
                if((i>>j & 1) == 1){ continue; }

                int score_tmp = score;
                int ans_tmp_tmp = ans_tmp;

                for(int k = 0; k < p[j] - 1; k++){
                    score_tmp += 100 * (j + 1);
                    ans_tmp_tmp++;

                    // スコア超えたらそこで終わり
                    if(score_tmp >= G){
                        ans = Math.min(ans, ans_tmp_tmp);
                        break;
                    }
                }
            }
        }
        out.println(ans);
    }
}
