#include <iostream>

using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;
    int t[n], h[n];
    for(int i=0; i<n; i++){
        cin >> t[i] >> h[i];
    }
    int m[n] = {0}, a=0;
    int M[n] = {0}, N[n] = {0};

    while(t[a]-t[0] < k){
        m[a] = h[a];
        a++;
    }

    int b, in, out, inb, outb;
    bool igen;

    while(a<n){
        b = a - 1;
        in = 0, out = 0;
        igen = false;
        while(t[a] - t[b] < k){                            //                5 20
            if(m[b] > in){                                 //10 10  0
                in = m[b];
                inb = b;                                 //20 40  1
            }                                              //30 10  2
            b--;                                           //40 20  3
        }                                                  //50 30  4
        while(t[a] - t[b] >= k && t[a] - t[b] < 2*k){
            if(m[b] > out){
                out = m[b];
                outb = b;
            }
            b--;
        }
        m[a] = max(in, out + h[a]);
        if(m[a] == in){
            M[a] = inb;
        }else if(m[a] == out + h[a]){
            M[a] = outb;
            igen = true;
        }
        a++;
    }

    cout << m[n-1] << endl;

    a--, b = 0;
    while(M[a] != 0){
        N[b] = M[a];
        a = M[a]; b++;
    }
    cout << b << " ";
    b--;

    for(int i=0; i<b; i++){
        cout << N[i] << " ";
    }
    if(igen){
        cout << n << " ";
    }

    return 0;
}