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

int main()
{
    int n,k;
    cin >>n>>k;
    vector<int> h(n+1);
    vector<int> c(n+1);
    vector<int> dp(n+1);
    vector<vector<int>> ans(n+1);
    for(int i=1;i<=n;i++){
        cin>>h[i]>>c[i];
        int j=i;
        while(j!=0&&h[j]+k>h[i]){
            j--;
        }
        dp[i]=max(dp[i-1],dp[j]+c[i]);
        if(dp[i]==dp[j]+c[i]){
            ans[i]=ans[j];
            ans[i].push_back(i);
        }
        else{
            ans[i]=ans[i-1];
        }
    }
    cout <<dp[n]<<endl;
    cout <<ans[n].size();
    for(int i:ans[n]){
        cout <<" "<<i;
    }
    return 0;
}