#include<bits/stdc++.h>
#define maxN 100005
#define dim 1000005
using namespace std;
long long n,x,st,dr,sol,mid,timp,nr,val,a[maxN];
pair<long long,long long> v[maxN];
char buff[dim+5];
int poz=0;
void read(long long &nr)
{
    nr=0;
    while(buff[poz]<'0' || buff[poz]>'9')
    {
        poz++;
        if(poz==dim)
        {
            poz=0;
            fread(buff,1,dim,stdin);
        }
    }
    while(buff[poz]>='0' && buff[poz]<='9')
    {
        nr=nr*10+buff[poz]-'0';
        poz++;
        if(poz==dim)
        {
            poz=0;
            fread(buff,1,dim,stdin);
        }
    }
}
int main()
{
    freopen("garaj.in","r",stdin);
    freopen("garaj.out","w",stdout);
    fread(buff,1,dim,stdin);
    read(n);
    read(x);
    for(int i=1;i<=n;i++)
    {
        read(v[i].first);
        read(v[i].second);
        //scanf("%d%d",&v[i].first,&v[i].second);
    }
    st=0;
    dr=2LL*INT_MAX;
    while(st<=dr)
    {
        long long mid=(st+dr)>>1LL;
        long long val=1LL;
        for(long long i=1;i<=n;i++)
        {
            val=val+(1LL*v[i].first)*(1LL*(mid/(2LL*v[i].second)));
        }
        if(val>=x)
        {
            sol=mid;
            dr=mid-1LL;
        }
            else st=mid+1LL;
    }
    printf("%lld ",sol);
    timp=sol;
    for(int i=1;i<=n;i++)
    {
        a[i]=v[i].first*((timp)/(2LL*v[i].second));
    }
    sort(a+1,a+n+1);
    for(int i=n;i>=1 && x>0;i--)
    {
        nr+=1LL;
        x-=a[i];
    }
    printf("%lld\n",nr);
    return 0;
}