#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<string>

 #include<cmath>

 #include<algorithm>

 using namespace std;

 const int maxn=;

 int a[maxn],dp[maxn];

 int main()

 {

     int n;

     while(cin>>n)

     {

         for(int i=;i<n;i++)

             scanf("%d",&a[i]);

         memset(dp,,sizeof(dp));

         dp[]=;

         for(int i=;i<n;i++)

         {

             if(a[i-]<=a[i])

                 dp[i]=dp[i-]+;

                 else

                     dp[i]=;

         }

         int mx=;

         for(int i=;i<n;i++)

             if(dp[i]>mx)

             mx=dp[i];

         cout<<mx<<endl;

     }

     return ;

 }

 #include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<string>

 #include<cmath>

 #include<vector>

 #include<algorithm>

 using namespace std;

 const int maxn=;

 typedef struct

 {

     long long m,s;

 }point;

 point p[maxn];

 bool cmp(point a,point b)

 {

     return a.m<b.m;

 }

 int main()

 {

     long long n,d;

     while(cin>>n>>d)

     {

         for(int i=;i<n;i++)

             cin>>p[i].m>>p[i].s;

         sort(p,p+n,cmp);

         long long ans=;

         long long cnt=;

         int j=;

         for(int i=;i<n;i++)

         {

             cnt+=p[i].s;

             while(p[i].m-p[j].m>=d)

             {

                 cnt-=p[j].s;

                 j++;

             }

             ans=max(ans,cnt);

         }

         cout<<ans<<endl;

     }

     return ;

 }