// UUID: bdaa8fff-eeea-4be8-9db9-5cf9c7c782ea
#include <bits/stdc++.h>
using namespace std;

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

	dp[0] = h[0];
	x[0].push_back(0);

	if(t[1] - t[0] > k){
		dp[1] = dp[0] + h[1];
		x[1] = x[0];
		x[1].push_back(1);
	}
	else{
		if(dp[0] > h[1]){
			dp[1] = dp[0];
			x[1] = x[0];
		}
		else{
			dp[1] = h[1];
			x[1].push_back(1);
		}
	}

	for(int i = 2; i < n; i++){
		if(t[i] - t[i-1] > k){
			dp[i] = dp[i-1] + h[i];
			x[i] = x[i-1];
			x[i].push_back(i);
		}
		else{
			dp[i] = max(dp[i-1], dp[i-2]+h[i]);
			if(dp[i-1] > dp[i-2]+h[i]){
				dp[i] = dp[i-1];
				x[i] = x[i-1];
			}
			else{
				dp[i] = dp[i-2] + h[i];
				x[i] = x[i-2];
				x[i].push_back(i);
			}
		}
	}

	cout << dp[n-1] << "\n" << x[n-1].size() << " ";
	for(int i : x[n-1]) cout << i+1 << " ";
}