#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>

using namespace std;

struct point {
    int distance, benefit, max_benefit;
};

int main() {
    cin.sync_with_stdio(false);
    cin.tie(nullptr);

    int N, K;
    cin >> N >> K;
    vector<point> dpS(N);    
    for (int i = 0; i < N; i++) {
        cin >> dpS[i].distance >> dpS[i].benefit;
        dpS[i].max_benefit = dpS[i].benefit;
        for (int j = 0; j < i; j++) {
            dpS[i].max_benefit = max(dpS[i].max_benefit, dpS[j].max_benefit + (dpS[j].distance + K <= dpS[i].distance ? dpS[i].benefit : 0));
        }
    }

    stack<int> answerS;
    int max_index = max_element(dpS.begin(), dpS.end(), [](point a, point b) { return a.max_benefit < b.max_benefit; }) - dpS.begin();
    answerS.push(max_index);
    while (dpS[0].distance + K <= dpS[answerS.top()].distance) {
        int current_max = 0;
        for (int i = 1; i < answerS.top() && dpS[i].distance + K <= dpS[answerS.top()].distance; i++) {
            if (dpS[i].max_benefit > dpS[current_max].max_benefit) {
                current_max = i;
            }
        }
        answerS.push(current_max);
    }
    cout << dpS[max_index].max_benefit << '\n' << answerS.size() << " ";
    while (!answerS.empty()) {
        cout << answerS.top() + 1 << " ";
        answerS.pop();
    }
    cout << '\n';
}