#include <iostream>
#include <vector>
using namespace std;

int max(int a, int b) {
	if (a > b)return a;
	else return b;
}

int main() {
	int n, k; cin >> n >> k;
	vector<pair<int, int>>v(n + 1); vector<int>dp(n + 1, 0);
	for (int i = 1; i <= n; i++)cin >> v[i].first >> v[i].second;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j < i; j++) {
			if (v[i].first - v[j].first >= k)dp[i] = max(dp[i], dp[j] + v[i].second);
		}
		dp[i] = max(dp[i], max(v[i].second, dp[i - 1]));
	}
	cout << dp[n] << '\n';
	vector<int>ans;
	int curr = dp[n];
	while (n != 0) {
		if (dp[n] > dp[n - 1] && dp[n] == curr) {
			ans.push_back(n);
			curr -= v[n].second;
		}
		n--;
	}
	cout << ans.size() << ' ';
	for (int i = ans.size() - 1; i >= 0; i--)cout << ans[i] << ' ';
}