// UUID: 39b5e6ec-df6d-4af2-99ae-b6e7d751b05c
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, k; cin >> n >> k;
	vector<pair<int, int>> stations(n + 1);
	for(int i = 1; i <= n; i++){
		cin >> stations[i].first >> stations[i].second;
	}
	vector<vector<int>> indexes(n + 1);
	vector<int> dp(n + 1);
	for(int i = 1; i <= n; i++){
		if(stations[i].first - stations[1].first >= k){
			int prev = 0;
			int maxdist = stations[i].first - k;
			for(int j = 0; stations[j].first <= maxdist; j++){
				prev = j;
			}
			if(dp[i - 1] < stations[i].second + dp[prev]){
				dp[i] = dp[prev] + stations[i].second;
				indexes[i] = indexes[prev];
				indexes[i].push_back(i);
			}
			else{
				dp[i] = dp[i - 1];
				indexes[i] = indexes[i - 1];
			}
				
		}
		else{
			dp[i] = max(dp[i - 1], stations[i].second);
			indexes[i].push_back(i);
		}
	}
	cout << dp[n] << endl;
	cout <<  indexes[n].size() << " ";
	for(auto u : indexes[n]){
		cout << u << " ";
	}
}