#include <bits/stdc++.h>
using namespace std;
int main() {
    int n,k; cin >> n >> k;
    vector<pair<int,int>> a(n);
    for (int i = 0; i < n; i++) cin >> a[i].first >> a[i].second;
    vector<pair<int,int>> dp(n,{0,-1});
    int outi = 0;
    for (int i = 0; i < n; i++) {
        dp[i].first = a[i].second;
        for (int j = i-1; j >= 0; j--) {
            if (a[i].first-a[j].first >= k) {
                if (a[i].second+dp[j].first >= dp[i].first) dp[i] = {a[i].second+dp[j].first,j};
            }
        }
        if (dp[i].first > dp[outi].first) outi = i;
    }
    cout << dp[outi].first << '\n';
    vector<int> out;
    do {
        out.push_back(outi);
        outi = dp[outi].second;
    } while (outi != -1);
    cout << out.size() << ' ';
    reverse(out.begin(), out.end());
    for (int x : out) cout << x+1 << ' ';
    cout << '\n';
}