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

int main() {
	int n, k;
	cin >> n >> k;
	vector<int> t(n), h(n);
	for (int i = 0; i < n; ++i) {
		cin >> t[i] >> h[i];
	}
	
	vector<pair<int, int>> dp(n);

	int curr_idx = 0;

	for (int i = 0; i < n; ++i) {
		dp[i].first = h[i];
		dp[i].second = -1;
		for (int j = 1; j <= i; ++j) {
			if (t[i] - t[i - j] >= k) {
				if (dp[i - j].first + h[i] > dp[i].first) {
					dp[i].first = dp[i - j].first + h[i];
					dp[i].second = i - j;
				}
			}
		}

		if (dp[i] > dp[curr_idx]) {
			curr_idx = i;
		}
	}

	vector<int> ans;

	while (curr_idx != -1) {
		ans.push_back(curr_idx);
		curr_idx = dp[curr_idx].second;
	}

	cout << dp[ans[0]].first << endl;
	cout << ans.size() << " ";
	for (auto it = ans.rbegin(); it != ans.rend(); ++it) {
		cout << *it + 1 << " ";
	}
	cout << endl;
}