#include<bits/stdc++.h>
#define inf 0x3f3f3f3f3f3f3f3fll
#define debug(x) cerr<<#x<<"="<<x<<endl
using namespace std;
using ll=long long;
using ld=long double;
using pli=pair<ll,int>;
using pi=pair<int,int>;
template<typename A>
using vc=vector<A>;
inline int read()
{
    int s=0,w=1;char ch;
    while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
    return s*w;
}
inline ll lread()
{
    ll s=0,w=1;char ch;
    while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
    return s*w;
}
int pre[5005];
int num[5005];
int a[5005];
int n,k,len;
int main()
{
    n=read(),k=read();
    for(int i=1;i<=n;i++) num[i]=a[i]=read();
    sort(num+1,num+n+1),len=unique(num+1,num+n+1)-num-1;
    for(int i=1;i<=n;i++) a[i]=lower_bound(num+1,num+n+1,a[i])-num;
    for(int i=2;i<=n;i++) pre[min(a[i-1],a[i])]++,pre[max(a[i-1],a[i])]--;
    for(int i=1;i<=len;i++) pre[i]+=pre[i-1];

    // for(int i=1;i<=len;i++) printf("%d%c",num[i]," \n"[i==len]);
    // for(int i=1;i<=len;i++) printf("%d%c",pre[i]," \n"[i==len]);

    int now=1;ll ans=0;
    for(int i=1;i<=len;i++)
    {
        while(now<len&&num[now+1]-num[i]<=k) now++;
        ll v=0;int rest=k-num[now]+num[i];
        for(int j=i;j<now;j++) v+=(ll)(num[j+1]-num[j])*pre[j];
        ans=max(ans,v+(ll)rest*max(pre[i-1],pre[now]));
        // printf("i=%d now=%d ans=%lld  %lld,%d\n",i,now,ans,v,rest);
    }
    printf("%lld\n",ans);
    return 0;
}