#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#define mid ((l+r)>>1)

using namespace std;

typedef long long ll;

int const xn=;

int n,m,ans,w[xn];

ll f[],tmp[xn],v[xn];

int rd()

{

    int ret=,f=; char ch=getchar();

    while(ch<''||ch>''){if(ch=='-')f=; ch=getchar();}

    while(ch>=''&&ch<='')ret=(ret<<)+(ret<<)+ch-'',ch=getchar();

    return f?ret:-ret;

}

bool ck(int k)

{

    for(int i=;i<=n;i++)tmp[i]=v[i]-(ll)w[i]*k;

    memset(f,-,sizeof f);//

    f[]=;

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

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

            f[min(m,j+w[i])]=max(f[min(m,j+w[i])],f[j]+tmp[i]);

    return f[m]>=;

}

int main()

{

    n=rd(); m=rd();

    for(int i=;i<=n;i++)w[i]=rd(),v[i]=rd()*;

    int l=,r=1e9;

    while(l<=r)

    {

        if(ck(mid))ans=mid,l=mid+;

        else r=mid-;

    }

    printf("%d\n",ans);

    return ;

}