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

int main() {

    int n, k; cin >> n >> k;
    vector<pair<int, int>> v(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> v[i].first >> v[i].second;
    }

    vector<int> dp(n + 1, 0);
    vector<vector<int>> honnan(n + 1);
    for (int i = 1; i <= n; i++) {
        int x = i;
        while (x > 0 && v[i].first - v[x].first < k) x--;
        dp[i] = max(dp[x] + v[i].second, dp[i - 1]);
        if (dp[i] != dp[i - 1]) {
            honnan[i] = honnan[x];
            honnan[i].push_back(i);
        } else {
            honnan[i] = honnan[i - 1];
        }
    }

    cout << dp[n] << endl << honnan[n].size() << " ";
    for (int& x : honnan[n]) cout << x << " ";

    return 0;
}