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

int main(){
    int n, k;
    cin >> n >> k;

    vector<int> tav(n);
    vector<int> profit(n);

    vector<int> DP(n);
    vector<int> DPI(n, -1);
    int bestI = 0;
    
    for(int i = 0; i< n; i++)
        cin >> tav[i] >> profit[i];
    
    for(int i = 0; i< n; i++){
        int bI = -1;
        
        for(int j = 0; j < i; j++)
            if(profit[j] > profit[bI] && tav[i] - tav[j] > k)
                bI = j;

        
        DP[i] = profit[bI] + profit[i];
        DPI[i] = bI;

        if(DP[bestI] < DP[i])
            bestI = i;
    }

    cout << DP[bestI] << "\n";
    vector<int> backTrack;
    int curr = bestI;

    while (DPI[curr] != -1)
    {
        backTrack.push_back(curr);
        curr = DPI[curr];
    }
    backTrack.push_back(curr);

    reverse(backTrack.begin(), backTrack.end());
    cout << backTrack.size() << " ";
    for(auto& i : backTrack)
        cout << i+1 << " ";
    
}