#include<bits/stdc++.h>
using namespace std;
int n,a[1005],k,stone,ans=0;
int main(){
    cin>>n>>k;
    for (int i=1;i<=n;i++) cin>>a[i];
    sort(a+1,a+1+n);
    for (int i=n-1;i>=1;i--){
        if (a[n]-a[i]<=k){
        	stone=a[i+1];
		}
	}
	for (int i=n;i>=1;i--) if (a[i]>=stone) ans+=a[i];
	cout<<ans;
	return 0;
}