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

int main(){
    int n,k; cin>>n>>k;
    int T[n+1],H[n+1],dp[n];
    T[0]=-k; H[0]=0;
    for (int i=0;i<n;i++){
        cin >> T[i] >> H[i];
    }
    dp[0]=0;
    vector<vector<int>> benzinkut(n);
    benzinkut.push_back({});
    for (int i=1;i<=n;i++){
        int j=i-1;
        while (j>0 && T[j]>T[i]-k){j--;}
        if (dp[i-1]>dp[j]+H[i]){
            dp[i]=dp[i-1]; benzinkut[i]=benzinkut[i-1];
        }
        else{
            dp[i]=dp[j]+H[i];
            benzinkut[i]=benzinkut[j];
            benzinkut[i].push_back(i+1);
        }
    }
    cout << dp[n] << "\n";
    cout << benzinkut[n].size() << " ";
    for (int i:benzinkut[n]){cout << i << " ";}
}