#include<bits/stdc++.h>
using namespace std;
struct money{
int price;
int number;
friend bool operator<(money a,money b)
{
return a.price<b.price;
}
}a[21];
int price[21],number[21],top=0;
int used[21];
int main(){
//freopen("P2376_7.in","r",stdin);
//freopen("money.out","w",stdout);
int n,c;
scanf("%d %d",&n,&c);
for(int i=1;i<=n;i++)
scanf("%d %d",&a[i].price,&a[i].number);
sort(a+1,a+n+1);
long long sum=0;
for(int i=1;i<=n;i++)
{
if(a[i].price>=c)
sum+=a[i].number;
else
{
top++;
price[top]=a[i].price;
number[top]=a[i].number;
}
}
int r=0;
while(true)
{
memset(used,0,sizeof(used));
int need=c;
for(int i=top;i>=1;i--)
{
if(price[i]>need||number[i]<=0)
continue;
if(number[i]>=need/price[i])
{
used[i]=need/price[i];
need%=price[i];
}
else
{
used[i]=number[i];
need-=used[i]*price[i];
}
}
for(int i=1;i<=top;i++)
{
if(need<=0)
break;
if(number[i]-used[i]<=0||need>price[i])
continue;
need-=price[i];
used[i]++;
}
if(need>0)
break;
int ans=INT_MAX;
for(int i=1;i<=top;i++)
if(used[i])
ans=min(ans,number[i]/used[i]);
for(int i=1;i<=top;i++)
number[i]-=ans*used[i];
sum=sum+ans;
}
printf("%lld\n",sum);
fclose(stdin);
fclose(stdout);
return 0;
}