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

public class Main {
	static int []p;
	static int []c;
	static int min;
	static int G;
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int D = scan.nextInt();
		G = scan.nextInt() / 100;
		p = new int[D];
		c = new int[D];
		int num = 0;

		for(int i = 0; i < D; i++) {
			int t1 = scan.nextInt();
			int t2 = scan.nextInt() / 100;
			p[i] = t1;
			c[i] = t2;
			num += p[i];
		}
		scan.close();
		min = num;

		int []bit = new int[D];
		rec(0, D, bit);
		System.out.println(min);

	}
	static void rec(int k, int n, int[] S) {
        if(k == n) {
        	solve(S);
            return;
        }
        rec(k + 1, n, S);
        S[k] = 1;
        rec(k + 1,n, S);
        S[k] = 0;
    }
	static void solve(int[] S) {
		int point = 0;
		int cnt = 0;
		for(int i = 0; i < S.length; i++) {
			if(S[i] == 1) {
				point += p[i] * (i + 1) * 1 + c[i];
				cnt += p[i];
			}
		}
		if(point >= G) {
			if(min > cnt) {
				min = cnt;
			}
		}else {
			int res = G - point;
			for(int i = S.length - 1; i >= 0; i--) {
				if(S[i] == 0) {
					int t = (i + 1) * 1;
					int k = (int)Math.ceil((double)res / t);
					if(k <= p[i] - 1) {
						if(min > cnt + k) {
							min = cnt + k;
						}
					}
				}
			}
		}
	}
}