#include <vector>
#include <string> 
#include <set> 
#include <map> 
#include <unordered_set>
#include <unordered_map>
#include <queue> 
#include <bitset> 
#include <stack>
#include <list>

#include <numeric> 
#include <algorithm> 
#include <random>
#include <chrono>

#include <cstdio>
#include <fstream>
#include <iostream> 
#include <sstream> 
#include <iomanip>
#include <climits>

#include <cctype>
#include <cmath> 
#include <ctime>
#include <cassert>

using namespace std;

#define ULL unsigned long long
#define LL long long
#define PII pair <int, int>
#define VB vector <bool>
#define VI vector <int>
#define VLL vector <LL>
#define VD vector <double>
#define VS vector <string>
#define VPII vector <pair <int, int> >
#define VVI vector < VI >
#define VVB vector < VB >
#define SI set < int >
#define USI unordered_set <int>
#define MII map <int, int>
#define UMII unordered_map <int, int>
#define MS multiset
#define US unordered_set
#define UM unordered_map
#define UMS unordered_multiset
#define UMM unordered_multimap

#define FORN(i, n) for(int i = 0; i < (n); ++i)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)

#define SZ size()
#define BG begin() 
#define EN end() 
#define CL clear()
#define X first
#define Y second
#define RS resize
#define PB push_back
#define MP make_pair
#define ALL(x) x.begin(), x.end()
#define INS insert
#define ER erase
#define CNT count

#define IN_FILE "a.in"
#define OUT_FILE "a.out"

template <typename T>
void PR(T var1)
{
	cout << var1 <<endl;
}
template <typename T, typename... Types>
void PR(T var1, Types... var2)
{
	cout << var1;
	PR(var2...);
}

int n, k;
VI a, c, dp, p;

int main()
{
	//freopen(IN_FILE, "r", stdin);
	//freopen(OUT_FILE, "w", stdout);

	cin >> n >> k;
	a.RS(n + 1);
	c.RS(n + 1);
	FOR(i, 1, n) cin >> a[i] >> c[i];

	dp.RS(n + 1);
	p.RS(n + 1);
	int best = 0;
	FOR(i, 1, n)
	{
		dp[i] = c[i];
		p[i] = 0;
		FOR(j, 1, i - 1)
			if (a[i] - a[j] >= k) 
				if (dp[i] < dp[j] + c[i])
				{
					dp[i] = dp[j] + c[i];
					p[i] = j;
				}
		if (dp[i] > dp[best]) best = i;
	}

	PR(dp[best]);
	int i = best;
	VI sol;
	while (i)
	{
		sol.PB(i);
		i = p[i];
	}
	sort(ALL(sol));
	cout << sol.SZ << " ";
	for (int i : sol) cout << i << " ";

	return 0;
}