#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#define int long long
class N{
	public:
		int a,b;
		inline bool operator <(const N &x)const{
			return a<x.a;
		}
		inline bool operator >(const N &x)const{
			return b>x.b;
		}
}a[100005];
std::priority_queue<N,std::vector<N>,std::less<N> >q;
signed main()
{
	int n,m;
	scanf("%lld%lld",&n,&m);
	for(int i=1;i<=n;++i)
	scanf("%lld%lld",&a[i].a,&a[i].b);
	std::sort(a+1,a+n+1);
	int t=0,ans=0,nans=0;
	for(int i=1;i<=n;++i)
	{
		t=t+a[i].a-a[i-1].a+a[i].b-1;
		nans++;
		q.push(a[i]);
		if(t>m&&!q.empty())t-=q.top().b,nans--,q.pop();
// 		if(t>m)break;
		ans=std::max(nans,ans);
	}
	printf("%lld",ans);
}