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;

class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int D = Integer.parseInt(sc.next());
		int G = Integer.parseInt(sc.next());
		int[][] arr  = new int [D][3];

		for(int i=0;i<D;i++) {
			arr[i][0] = Integer.parseInt(sc.next());
			arr[i][1] = Integer.parseInt(sc.next());
			arr[i][2] = arr[i][0]*100*(i+1) +arr[i][1];
		}
		int totalQueMin = Integer.MAX_VALUE;

		for(int i=0;i<1<<D;i++) {
			int totalQue = 0;
			int totalPoint = 0;
			boolean[] arrFlg = new boolean[D];
			for(boolean a:arrFlg) a = false;
			for(int j=0;j<D;j++) {
				if((1& i>>j) == 1) {
					totalQue += arr[j][0];
					totalPoint += (arr[j][1] + 100*(j+1)*arr[j][0]);
//					System.out.print("1");
					arrFlg[j] = true;
				} else {
//					System.out.print("0");
				}
			}
			label:while(totalPoint < G) {
				for(int m=D; m > 0; m--) {
					if(!arrFlg[m-1]) {
						int aa = m-1;
						for(int n=0;n<arr[aa][0];n++) {
							totalPoint += 100*(m);
							totalQue++;
							if(totalPoint >= G) break label;
						}
						totalPoint += arr[m-1][1];
							if(totalPoint >= G) break label;
					}
				}
			}

//			System.out.println("-----------------");
//			System.out.print(totalQue+ "  ");
//			System.out.println(totalPoint);
			totalQueMin = Math.min(totalQueMin, totalQue);
		}
		System.out.println(totalQueMin);


	}
}