#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;
    vector<int> dp(n, 0), val(n, 0), dist(n, 0), prev(n, -1);
    for (int i=0; i < n; i++) {
        cin >> dist[i] >> val[i];
    }
    dp[0] = val[0];
    for (int i=1; i < n; i++) {
        dp[i] = val[i];
        int idx = -1;
        int j = 0;
        while (j < i && dist[i] - dist[j] >= k) {
            if (idx == -1) {
                idx = j;
            } else if (dp[j] > dp[idx]) {
                idx = j;
            }
            j = j + 1;
        }
        if (idx == -1) {
            dp[i] = max(dp[i], dp[i - 1]);
            prev[i] = prev[i - 1];
        } else {
            dp[i] = max(dp[i] + dp[idx], dp[i - 1]);
            prev[i] = idx;
        }
    }
    vector<int> res;
    int idx = n - 1;
    if (dp[n - 1] == dp[n - 2]) {
        idx = prev[n - 1];
    }
    while (idx >= 0) {
        res.push_back(idx + 1);
        idx = prev[idx];
    }
    reverse(res.begin(), res.end());
    cout << dp[n - 1] << '\n';
    cout << res.size() << ' ';
    for (int x : res) cout << x << ' ';
    return 0;
}