// UUID: 80fedc39-61ff-49d8-baeb-030fd71a6e28
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, k;
	cin >> n >> k;

	vector<pair<long long, long long>> tavolsag(n + 1);

	for(int i=1;i <= n; i++){
		cin >> tavolsag[i].first >> tavolsag[i].second;
	}

	tavolsag[0].first = tavolsag[1].second;
	tavolsag[1].second = 0;
	vector<long long> dp(n+1);
	vector<vector<long long>> ans(n+1);
	dp[0] = 0;
	for(int i = 1; i <= n; i++){
		for(int j = i - 1; j > -1; j--){
			if(tavolsag[i].first - tavolsag[j].first >= k){
				dp[i] = max(dp[i - 1], dp[j] + tavolsag[i].second);
				if(dp[i - 1] < dp[j] + tavolsag[i].second){
					ans[i] = ans[j];
					ans[i].push_back(i);
				}
				else ans[i] = ans[i - 1];
				break;
			}
		}
	}
	cout << dp[n] << "\n" << ans[n].size();
	for(int x : ans[n]){
		cout << " " << x;
	}
}