#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, k;
	int ans = 0;
	int result;
	cin >> n >> k;
	int a[1005];
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	sort(a, a + n);
	int j = 0;
	for (int i = 0; i < n; i++) {
		ans += a[i];
		if (a[i] - a[j] > k) {
			result = ans;
			while (a[i] - a[j] > k) {
				result -= a[j];
				j++;
			}
			ans = max(ans - a[i], result);
		}
	}
	printf("%d", ans);
	return 0;
}