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

void solve(){
    int n, k;
    cin>>n>>k;
    vector<pair<int, int>> kut(n+1, {0, 0});
    for(pair<int, int> &x : kut) cin>>x.first>>x.second;
    vector<int> dp(n+1);
    vector<int> parent(n+1);
    for(int i=0; i<n; i++){
        dp[i]=kut[i].second;
        parent[i]=i;
        for(int j=0; j<i; j++){
            if(kut[i].first-kut[j].first>=k){
                if(dp[i]<dp[j]+kut[i].second){
                    dp[i]=dp[j]+kut[i].second;
                    parent[i]=j;
                }
            }
        }
    }
    int ans=0, ansh=0;
    for(int i=0; i<n; i++){
        if(dp[i]>ans){
            ans=dp[i];
            ansh=i;
        }
    }
    stack<int> val;
    int curr=ansh;
    while(curr!=parent[curr]){
        val.push(curr+1);
        curr=parent[curr];
    }
    cout<<ans<<"\n"<<val.size()+1<<" "<<curr+1<<" ";
    while(!val.empty()){
        cout<<val.top()<<" ";
        val.pop();
    }
    return;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    solve();
    return 0;
}