#include <fstream>

using namespace std;

ifstream fin  ("lapte.in");
ofstream fout ("lapte.out");

int n, L, i, st, dr, mid;
int a[105], b[105];

inline bool check (int mid){
    for (i=1; i<=n; i++){
        for (j=0; j<=L; j++){
            d[i][j] = -1;
        }
    }
    for (j=0; j<=min (L, (t-a[1]*j)/b[1])){
        d[1][j] = (t-a[1]*j)/b[1];
        t[1][j] = j;
    }
    for (i=2; i<=n; i++){
        for (j=0; j<=min (L, (t-a[i]*j)/b[i])){

        }
    }
}

int main(){
    fin >> n >> L;
    for (i=1; i<=n; i++){
        fin >> a[i] >> b[i];
    }
    st = 1, dr = L*(a[1] + b[1]);
    while (st <= dr){
        mid = st + (dr - st)/2;
        if (check (mid)){
            dr = mid - 1;
        }
        else{
            st = mid + 1;
        }
    }
    fout << st << "\n";
    check (st);
    path (n, L);
    return 0;
}
// nu e gata