#include<iostream>

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<queue>

#include<iomanip>

#define re register

#define ll long long

using namespace std;

ll  n,m,ans,maxx,sum;

struct market

{

    ll x,t;

};

market a[];

priority_queue<int> q;

inline bool cmp(market x,market y)

{

    return x.x<y.x;

}

int main()

{

    cin>>n>>m;

    for(re int i=;i<=n;i++) {cin>>a[i].x>>a[i].t;}

    sort(a+,a+n+,cmp);

    ll k=;

    while(k<n)

    {

        k++;

        if(a[k].x>=m)

        break;

        ll cnt=m-a[k].x;

        sum+=a[k].t;

        q.push(a[k].t);

        maxx++;

        while(sum>cnt)

        {

            sum-=q.top();

            q.pop();

            maxx--;

        }

        ans=max(maxx,ans);

    }

    cout<<ans;

}