// UUID: ed283ba9-146c-4b1d-9668-26fb851187ee
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, k; cin >> n >> k;
    vector<int> a(n+1), b(n+1), c(n+1);
    vector<long long> dp(n+1);
    for(int i = 1; i <= n; i++) cin >> a[i] >> b[i];
    for(int i = 1; i <= n; i++){
        dp[i] = dp[i-1];
        c[i] = -1;
        int j = i - 1;
        while(j > 0 && a[j] > a[i] - k){
            j--;
        }
        if(dp[j] + b[i] > dp[i]){
                dp[i] = dp[j] + b[i];
                c[i] = j; 
            }
    }
    vector<int> d;
    for(int i = n; i > 0; ){
        if(c[i] != -1){
            d.push_back(i);
            i = c[i];
        }
        else i--;
    }
    sort(d.begin(), d.end());
    cout << dp[n] << "\n" << d.size();
    for(int i : d){
        cout << " " << i;
    }
}