#include<iostream>

#include<cstdio>

#include<cstring>

#include<string>

#include<algorithm>

#include<cctype>

#include<cmath>

#include<cstdlib>

#include<queue>

#include<ctime>

#include<vector>

#include<set>

#include<map>

#include<stack>

using namespace std;

#define int long long

struct node {

    int w,t;

};

node d[];

int dp[],n,m;

inline bool go(int mid){

    int i,j,k;

    memset(dp,-0x3f,sizeof(dp));

    dp[]=;

    for(i=;i<=n;i++)

      for(j=m;j>=;j--)

        dp[min(m,j+d[i].w)]=

          max(dp[j]+d[i].t-d[i].w*mid,dp[min(m,j+d[i].w)]);

    return dp[m]>=;

}

signed main(){

    int i,j,s1=,s2=;

    scanf("%d%d",&n,&m);

    for(i=;i<=n;i++){

      scanf("%d%d",&d[i].w,&d[i].t);

      d[i].t*=;

    }

    int le=,ri=;

    while(ri-le>){

      int mid=(le+ri)>>;

      if(go(mid))le=mid;

        else ri=mid;

    }

    cout<<le;

    return ;

}