// UUID: 595c6f76-6f81-4a25-9e6e-366e843c9e07
#include <bits/stdc++.h>
using namespace std;

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

    vector<long long> T(N + 1), H(N + 1);
    for (int i = 1; i <= N; i++) {
        cin >> T[i] >> H[i];
    }
    vector<long long> dp(N + 1, 0);
    vector<int> prev(N + 1, -1);
    vector<bool> take(N + 1, false);
    for (int i = 1; i <= N; i++) {
        dp[i] = dp[i - 1];
        int lo = 1, hi = i - 1, best = 0;
        while (lo <= hi) {
            int mid = (lo + hi) / 2;
            if (T[i] - T[mid] >= K) {
                best = mid;
                lo = mid + 1;
            } else {
                hi = mid - 1;
            }
        }
        long long candidate = dp[best] + H[i];
        if (candidate > dp[i]) {
            dp[i] = candidate;
            take[i] = true;
            prev[i] = best;
        }
    }
    vector<int> chosen;
    int i = N;
    while (i > 0) {
        if (take[i]) {
            chosen.push_back(i);
            i = prev[i];
        } else {
            i--;
        }
    }
    reverse(chosen.begin(), chosen.end());
    cout << dp[N] << "\n";
    cout << chosen.size();
    for (int idx : chosen) {
        cout << " " << idx;
    }
    cout << "\n";

    return 0;
}