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.io.PrintStream;
    import java.util.Scanner;
	
	public class Main {
        private static final PrintStream so = System.out;
        private static final Scanner     sc = new Scanner(System.in);
    
        public static void main(String[] args) {
            int n = sc.nextInt();
            int g = sc.nextInt();
            
            int[] p = new int[n + 1];
            int[] comp = new int[n + 1];
            int[] maxUnComp = new int[n + 1];
            
            for (int i = 1; i <= n; i++) {
                p[i] = sc.nextInt();
                maxUnComp[i] = 100*(i) * (p[i] - 1);
                comp[i] = maxUnComp[i] + 100*i + sc.nextInt();
            }
            
            int ans = Integer.MAX_VALUE;
            for (int pattern = 0; pattern < 1 << n; pattern++) {
                int sumS = sum(comp, pattern, n); // score
                int needed = g - sumS;
                int idx = firstIdxOf0(pattern, n) + 1;
                
                if (needed > maxUnComp[idx]) continue;
                int sumQ = sum(p   , pattern, n); // number of questions to solve
                sumQ += idx == 0 ? 0 : Math.max(ceil(needed, 100*idx), 0);
                ans = Math.min(ans, sumQ);
            }
            so.println(ans);
        }
        
        // ^q^
        static int ceil(int a, int b) {
            return (a + b - 1) / b;
        }
        
        static int sum(int[] a,int bits, int numBits) {
            int sum = 0;
            int mask = 1;
            for (int i = 0; i < numBits; i++) 
                if ((bits >> i & mask) == 1)
                    sum += a[i+1];
            return sum;
        }
        
        static int firstIdxOf0(int bits, int numBits) {
            int mask = 1;
            for (int i = numBits - 1; i >= 0; i--)
                if ((bits >> i & mask) == 0)
                    return i;
            return -1;
        }
    }
