// UUID: 43cd5f20-55f7-4b27-a024-7b4f3ed34229
//AB
//Feladat linkje: 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    int n, mintav;
    cin >> n >> mintav;
    vector<int> tav(n+1);
    vector<int> haszon(n+1);
    vector<int> dp(n+1, 0);
    vector<vector<int>> eredmeny(n+1);
    for (int i = 1; i <= n; i++) {//beolv
        cin >> tav[i] >> haszon[i];
    }
    for (int i = 1; i <= n; i++) {//dpszamol
        int j = i;
        while(j > 0 && tav[i]-tav[j] < mintav) {
			j--;
		}//dp[i] = max(dp[i-1], dp[j]+haszon[i]);
        if (dp[i-1] > dp[j]+haszon[i]) {
            dp[i] = dp[i-1];
            eredmeny[i] = eredmeny[i-1];
        } else {
            dp[i] = dp[j]+haszon[i];
            eredmeny[i] = eredmeny[j];
            eredmeny[i].push_back(i);
        }
		
    }
	cout << dp[n] <<"\n";
	cout << eredmeny[n].size() <<" ";
    for(int i : eredmeny[n]) {
        cout << i << " ";
    }
    
}