#include <iostream>
#include<algorithm>
#include<vector>
#include<climits>

using namespace std;
using ll = long long;

#define endl "\n";


int main() {
	int n, k;
	cin >> n >> k;
	vector<int> hely = { -1 * k - 1 };
	vector<int> hozam = { 0 };
	for (int i = 0; i < n;i++) {
		int a, b;
		cin >> a >> b;
		hely.push_back(a);
		hozam.push_back(b);
	}

	vector<int> dp(n + 1);
	dp[0] = 0;
	vector<vector<int>> ans(n + 1);
	for (int i = 1; i <= n;i++) {
		for (int j = i - 1; j >= 0; j--) {
			if (hely[j] <= hely[i] - k) {
				if (dp[i - 1] > dp[j] + hozam[i]) {
					dp[i] = dp[i - 1];
					ans[i] = ans[i - 1];
					break;
				}
				else {
					dp[i] = dp[j] + hozam[i];
					ans[i] = ans[j];
					ans[i].push_back(i);
					break;
				}

			}

		}
	}
	cout << dp[n] << endl;
	cout << ans[n].size() << " ";
	for (int x : ans[n]) cout << x << " ";
}