#include <iostream>
#include <vector>

using namespace std;

struct RestStop {
    int distance;
    int profit;
};

int main() {
    int N, K;
    cin >> N >> K;

    vector<RestStop> restStops(N + 1);
    vector<vector<int>> dp(N + 1, vector<int>(N + 1, 0));

    for (int i = 1; i <= N; i++) {
        cin >> restStops[i].distance >> restStops[i].profit;
    }

    for (int i = 1; i <= N; i++) {
        for (int j = i - 1; j >= 0; j--) {
            dp[i][j] = max(dp[i][j], dp[i - 1][j]);

            int distance = restStops[i].distance - restStops[j].distance;

            if (distance >= K) {
                dp[i][j] = max(dp[i][j], dp[j][j] + restStops[i].profit);
            }
        }
    }

    int maxProfit = 0;
    int lastStop = 0;
    for (int i = 1; i <= N; i++) {
        if (dp[N][i] > maxProfit) {
            maxProfit = dp[N][i];
            lastStop = i;
        }
    }

    cout << maxProfit << endl;

    vector<int> chosenStops;
    for (int i = lastStop; i >= 1; i--) {
        if (dp[lastStop][i] > dp[lastStop][i - 1]) {
            chosenStops.push_back(i);
            lastStop = i - 1;
        }
    }

    cout << chosenStops.size() << endl;
    for (int i = chosenStops.size() - 1; i >= 0; i--) {
        cout << chosenStops[i] << " ";
    }

    return 0;
}