#include <iostream>
#include<vector>
#include <algorithm>
using namespace std;


int main()
{
	int n, k;
	cin >> n >> k;
	vector<int> loc(n);
	vector<int> pro(n);
	vector<int> elozo(n, -1);
	for (int i = 0; i < n; ++i)
	{
		cin >> loc[i] >> pro[i];
		int j = i - 1;
		while (j > -1 and loc[i] - loc[j] < k) --j;
		if (j > -1)
		{
			auto it = max_element(pro.begin(), pro.begin() + j + 1);
			pro[i] += *it;
			elozo[i] = it - pro.begin();
		}
		else elozo[i] = -1;
	}
	auto it = max_element(pro.begin(), pro.end());
	cout << *it <<endl;
	vector<int> index;
	int i = it - pro.begin();
	while (i != -1)
	{
		index.push_back(i);
		i = elozo[i];
	}
	cout << index.size()<<" ";
	for (i = index.size() - 1; i >= 0; --i) cout << index[i] + 1<<" ";
	return 0;
}