#include <bits/stdc++.h>
using namespace std;
struct pih{int ert,tav,penz=0; vector<int>bem;};;
int main()
{
    int n,m; cin>>n>>m;
    pih a[n];
    for(int i=0; i<n; i++){cin>>a[i].tav>>a[i].ert;}
    int maxi=a[n-1].tav,j=n-1; bool tavi=0;
    while(!tavi){
        a[j].penz=a[j].ert; a[j].bem.push_back(j);
        if(m<=maxi-a[j-1].tav)tavi=1;
        j--;}
    int p,maxim,maxind;
    for(int i=j; i>=0; i--){
        p=i; maxim=0;
        while(p<n){
            if(a[p].tav-a[i].tav>=m && a[p].penz>maxim){
                maxim=a[p].penz; maxind=p;}
                p++;}
        a[i].penz=a[i].ert+maxim;
        a[i].bem=a[maxind].bem; a[i].bem.push_back(i);}
    maxim=0;
    for(int i=0; i<n; i++){if(a[i].penz>maxim){maxim=a[i].penz; maxind=i;}}
    cout<<a[maxind].penz<<endl;
    cout<<a[maxind].bem.size()<<" ";
    sort(a[maxind].bem.begin(),a[maxind].bem.end());
    for(int i=0; i<a[maxind].bem.size(); i++){cout<<a[maxind].bem[i]+1<<" ";}
    return 0;
}