// UUID: fc65f829-9b36-4aa9-b19e-769658322456
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> v;
vector<vector<int>> dp;
vector<int> t;

int main()
{
	int n, k;
    cin >> n >> k;
    v.resize(n+1, vector<int>(2));
    dp.resize(n+1, vector<int>(1));
    for(int i=1; i<=n; i++)
    {
        cin >> v[i][0] >> v[i][1];
    }
    dp[0][0]=0;
    int elozo;
    for(int i=1; i<=n; i++)
    {
        int elozo=-1;
        for(int j=i-1; j>0; j--)
        {
            if(v[i][0]-v[j][0]>=k)
            {
                dp[i][0]=max(dp[i-1][0], dp[j][0]+v[i][1]);
                if(dp[i-1][0]>=dp[j][0]+v[i][1])
                {
                    elozo=i-1;
                    dp[i] = dp[i - 1];
                }
                else
                {
                    elozo=j;
                    dp[i] = dp[j];
                    dp[i][0] = dp[j][0]+v[i][1];
                    dp[i].push_back(i);
                }
                break;
            }
        }
        if (elozo==-1){
            if (v[i][1]>dp[i-1][0]){
                dp[i][0]=v[i][1];
                dp[i].push_back(i);
            }
            else{
                dp[i] = dp[i-1];
            }
        }
    }
    cout << dp[n][0] << '\n' << dp[n].size()-1 << " ";
    for(int i=1; i<dp[n].size(); i++)
    {
        cout << dp[n][i] << " ";
    }
}
/*
3 2 



*/