#include <iostream>
#include <stack>

using namespace std;

struct kut{
    int d;
    int h=0;
    int h1;
    int prev=0;
    int depth=1;
}v[1001];

int main()
{
    int n,k;
    int maxh=0, maxi=1;;
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>v[i].d>>v[i].h;
        v[i].h1=v[i].h;
        for(int j=1;j<=n;j++){
            if(v[i].d-v[j].d<k) break;
            if(v[i].h+v[j].h1>v[i].h1){
                v[i].h1=v[i].h+v[j].h1;
                v[i].depth=v[j].depth+1;
                v[i].prev=j;
            }
        }
    }
    for(int i=1;i<=n;i++){
        if(v[i].h1>maxh){
            maxh=v[i].h1;
            maxi=i;
        }
    }
    cout<<maxh<<'\n'<<v[maxi].depth;
    stack <int> verem;
    while(maxi!=0){
        verem.push(maxi);
        maxi=v[maxi].prev;
    }
    while(!verem.empty()){
        cout<<' '<<verem.top();
        verem.pop();
    }

    return 0;
}