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

using namespace std;
using ll = long long;

#define endl "\n";
struct kut {
	int hely;
	int hoz;
};
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m;
	cin >> n >> m ;
	vector<kut>kutak(n+1);
	vector<int>dp(n+1);
	dp[0] = 0;
	vector<vector<int>>ans(n+1);
	for (int i = 1;i <= n;i++) {
		cin >> kutak[i].hely >> kutak[i].hoz;
	}
	for (int i = 1;i <= n;i++) {
		for (int j = i - 1;j >= 0;j--) {
			if (kutak[i].hely - m >= kutak[j].hely) {
				if (dp[i-1] > dp[j] + kutak[i].hoz) {
					dp[i] = dp[i - 1];
					ans[i] = ans[i - 1];
					break;
				}
				else {
					dp[i] = dp[j] + kutak[i].hoz;
					ans[i] = ans[j];
					ans[i].push_back(i);
					break;
				}
			}
		}
	}
	cout << dp[n] <<"\n"<< ans[n].size()<<" ";
	for (int i = 0;i < ans[n].size();i++) {
		cout << ans[n][i] << " ";
	}

}