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

public class Main {
	static int num=9999;
	static int d;
	static int g;
	static int p[];
	static int c[];
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		d = sc.nextInt();
		g = sc.nextInt();
		p = new int[d];
		c = new int[d];

		for(int i=0;i<d;i++) {
			p[i] = sc.nextInt();
			c[i] = sc.nextInt();
		}
		
		calc(0,0,0,0);
		
		System.out.println(num);
	}
	
	static void calc(int piv, int tmp_num, long tmp_sum, long check) {
		if( piv==d ) {
			if( tmp_sum<g ) {
				for(int i=d;i>0;i--) {
					// 既に解いている問題ならスルー
					if( check/(Math.pow(10,i-1))==1 || (check/(Math.pow(10,i-1)))%Math.pow(10,d-i) == 1)
						continue;
					if( tmp_sum+100*i*(p[i-1]-1) >= g ) {
						while(true) {
							tmp_num++;
							tmp_sum += 100*i;
							if(tmp_sum >= g)
								break;
						}
						break;
					}
				}
			}
			if( tmp_sum>=g && num>tmp_num && tmp_num!=0 )
				num = tmp_num;
			return;
		}
		
		// 100*piv点の問題を全て解いた場合
		calc(piv+1,tmp_num+p[piv],tmp_sum+100*(piv+1)*p[piv]+c[piv],check+(long)Math.pow(10,piv));
		// 100*piv点の問題を全く解かない場合
		calc(piv+1,tmp_num,tmp_sum,check);
	}
}
