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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Washoum
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        inputClass in = new inputClass(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CAllGreen solver = new CAllGreen();
        solver.solve(1, in, out);
        out.close();
    }

    static class CAllGreen {
        public void solve(int testNumber, inputClass sc, PrintWriter out) {
            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();
            }
//        int a=0;
//        int at=0;
//        int j=d-1;
//        while (a<g && j>=0){
//            long rem = g - a;
//            if (rem <=(p[j]-1)*(j+1)*100){
//                at+= rem /((j+1)*100) + ((rem%((j+1)*100))==0 ? 0 : 1);
//                break;
//            }
//            else{
//                a+=(p[j]-1)*(j+1)*100;
//                at+=p[j]-1;
//                j--;
//            }
//        }
            int ans = Integer.MAX_VALUE;
//        if (j>=0){
//            ans=a;
//        }
            for (int mask = 0; mask < (1 << d); mask++) {
                int act = 0;
                long score = 0;
                boolean[] active = new boolean[d];
                for (int i = 0; i < d; i++) {
                    if ((mask & (1 << i)) > 0) {
                        act += p[i];
                        score += p[i] * 100 * (i + 1) + c[i];
                        active[i] = true;
                    }
                }
                int i = d - 1;
                while (score < g && i >= 0) {
                    if (active[i]) {
                        i--;
                    } else {
                        long rem = g - score;
                        if (rem <= (p[i] - 1) * (i + 1) * 100) {
                            score = g + 1;
                            act += rem / ((i + 1) * 100) + ((rem % ((i + 1) * 100)) == 0 ? 0 : 1);
                            break;
                        } else {
                            score += (p[i] - 1) * (i + 1) * 100;
                            act += p[i] - 1;
                            i--;
                        }
                    }
                }
                if (score >= g) {
                    ans = Math.min(ans, act);
                }
            }
            out.println(ans);
        }

    }

    static class inputClass {
        BufferedReader br;
        StringTokenizer st;

        public inputClass(InputStream in) {

            br = new BufferedReader(new InputStreamReader(in));
        }

        public String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}

