#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;
    vector<vector<int>> a(n, vector<int>(5, 0));
    for(int i = 0;i < n; i++){
        cin >> a[i][0] >> a[i][1];
    }
    int p = a[n-1][1];
    a[n-1][2]=1;
    a[n-1][3]=1;
    a[n-1][4] = a[n-1][1];
    for (int i = n-2; i>=0; i--){
        int temp = a[i][1];
        int j = i;
        while (j < n && a[j][0]-k<a[i][0]){
            if (a[j][2]==1){
                temp-= a[j][4];
                a[j][3]=0;
            }
            j++;
        }
        a[i][4] = temp;
        if (temp>0){
            int j =0;
            while (j < n && a[j][0]-k<a[i][0]){
                a[j][2]=a[j][3];
                j++;
            }
            p+=temp;
            a[i][2]=1;
            a[i][3]=1;
        }
    }
    cout << p << '\n';
    int s;
    vector<int> solve;
    for (int i = 0; i<n; i++){
        if (a[i][2]==1){
            s++;
            solve.push_back(i+1);
        }
    }
    cout << s << " ";
    for(int i = 0; i<solve.size(); i++){
        cout << solve[i] << " ";
    }

    return 0;
}