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

#define fi first
#define se second

int main(){
    int n, k; cin>>n>>k;
    vector<pair<int, int>> v(n+1);
    vector<int> dp(n+1), dpx(n+1);
    int x=0;
    for(int i=1; i<=n; i++){
        cin>>v[i].fi>>v[i].se;
        //if(v[i].fi<k){dp[i]=max(dp[i-1], v[i].se);}
        while(v[x+1].fi+k<=v[i].fi){x++;}
        dp[i]=max(dp[i-1], dp[x]+v[i].se);
        dpx[i]=x;
    }
    cout<<dp[n]<<endl;
    int i=n;
    vector<int> ans;
    while(i>0){
        if(dp[i]==dp[i-1]){
            i--; continue;
        }
        ans.push_back(i);
        i=dpx[i];
    }
    cout<<ans.size()<<" ";
    for(int i=ans.size()-1; i>=0; i--){
        cout<<ans[i]<<" ";
    }
    return 0;
}