#include <iostream>

using namespace std;

struct{
    int hely;
    int hasz;
} a[1000];
int n, k, L[1000], maxi, kov[1000];

int main()
{
    cin >> n >> k;
    for(int i = 1; i <= n; i++) {
       cin >> a[i].hely >> a[i].hasz;
       kov[i] = -1;
    }

    for(int i = n; i >= 1; i--) {
        L[i] = a[i].hasz;
        int ln = 0;
        for(int j = i+1; j <= n; j++) {
            if(a[j].hely - a[i].hely >= k && L[j] > ln) {
                ln = L[j];
                kov[i] = j;
            }
        }
        L[i] += ln;
        if(maxi < L[i])
            maxi = L[i];
    }

    cout << maxi << endl;
    int t = 1, jo[1000];
    for(int i = 1; i <= n; i++)
        if(L[i] == maxi) {
            jo[1] = i;
            while(kov[i] != -1) {
                t++;
                jo[i] = kov[i];
                i = kov[i];
            }
            break;
        }
    cout << t << ' ';
    for(int i = 1; i <= t; i++)
        cout << jo[i] << ' ';

    return 0;
}