// UUID: 6e7c0025-a0dd-4aa9-81e2-71f1e77625bc
#include <iostream>
#include <vector>
using namespace std;

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

    vector<int> T(N + 1), H(N + 1);
    for (int i = 1; i <= N; i++) {
        cin >> T[i] >> H[i];
    }

    vector<int> dp(N + 1, 0);
    vector<bool> take(N + 1, false);
    vector<int> prev(N + 1, 0);

    for (int i = 1; i <= N; i++) {
        dp[i] = dp[i - 1];

        int j = i - 1;
        while (j > 0 && T[j] > T[i] - K) {
            j--;
        }

        int value = dp[j] + H[i];
        if (value > dp[i]) {
            dp[i] = value;
            take[i] = true;
            prev[i] = j;
        }
    }
    vector<int> result;
    int i = N;
    while (i > 0) {
        if (take[i]) {
            result.push_back(i);
            i = prev[i];
        } else {
            i--;
        }
    }
    cout << dp[N] << endl;
    cout << result.size();

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

    return 0;
}