#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n,k,a[1005];
ll dp[1005];
int main() {
	cin>>n>>k;
	for(int i = 1; i <= n; i++)cin>>a[i];
	sort(a,a+n);
	for(int i = 1; i <= n; i++) {
		dp[i] = dp[i-1] + a[i];
	}
	ll ans=0;
	for(int i = 1,j = 1; i <= n; j++) {
		while(i <= n && a[i] - a[j] <= k) i++;
		ans=max(ans,dp[i-1]-dp[j-1]);
	}
	cout<<ans;
	return 0;
}