// Source: https://usaco.guide/general/io

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

#define f first
#define s second

int main() {
	int n, k;
	cin >> n >> k;
	vector<pair<int, int> > v(n+1);
	int dp[n+1], p[n+1];
	for(int i = 0; i < n+1; i++) p[i] = 0;
	for(int i = 1; i <= n; i++) {
		cin >> v[i].f >> v[i].s;
	
	}
	vector<int> ans;
	
	for(int i = 1; i <= n; i++) {
		dp[i] = v[i].s;
		
		int j = i-1;
		int mx = 0;
		while (j > 0) {
			if (v[i].f-v[j].f >= k) {
				if (mx < dp[j]) {
					mx = dp[j];
					p[i] = j;
				}
			}
			j--;
		}
		dp[i] += mx;
		//cout << i << ": " << dp[i] << endl;
		
	}
	int maxos = 0, megoldas = 0;

	for(int i = 1; i <= n; i++) {
		if (maxos < dp[i]) {
			maxos = dp[i];
			megoldas = i;
		}
	}
	int i = megoldas;
	ans.push_back(megoldas);
	cout << dp[megoldas] << endl;

	while(p[i] != 0) {
		ans.push_back(p[i]);
		i = p[i];
	}
	cout << ans.size() << ' ';
	reverse (ans.begin(), ans.end());
	for(int x : ans) cout << x << ' ';

}