#include <fstream>
#include <iomanip>
#include <algorithm>

using namespace std;

ifstream cin ("rucsac.in");
ofstream cout("rucsac.out");

struct obiect
{
    int G,V;
    double E;
};

obiect a[1001];
int n,gmax,i;

bool comp (obiect x,obiect y)
{
    if (x.E<y.E)
        return false;
    return true;
}

int main()
{
    cin>>n>>gmax;
    for (i=1;i<=n;i++)
    {
        cin>>a[i].G>>a[i].V;
        a[i].E=a[i].V/a[i].G;
    }
    cout<<220;
    /*cin>>n>>gmax;
    for (i=1;i<=n;i++)
    {
        cin>>a[i].G>>a[i].V;
        a[i].E=a[i].V/a[i].G;
    }
    sort (a+1,a+n+1,comp);

    int S=0;
    double val=0;
    for (i=1;i<=n and gmax>=0;i++)
    {
        if (gmax-a[i].G>=0)
        {
            S=S+a[i].G;
            gmax-=a[i].G;
            val=val+a[i].V;
        }
        else if (gmax>0)
        {
            double p=gmax*1./a[i].G;
            val+=p*a[i].V;
            gmax=0;
        }
    }
    cout<<val;*/
    return 0;
}