#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// const ll MOD = 1e9+7;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, k; cin >> n >> k;
    vector<int> dp(n+1, 0);
    vector<pair<int, int>> a(n+1);
    for (int i = 1; i <= n; i++) {
    	cin >> a[i].first >> a[i].second;
    }
    
    vector<pair<int, int>> honnan(n+1, {-1, -1}); // {honnan, amit hozzávesz}
    for (int i = 1; i <= n; i++) {
    	int j = i-1;
    	while (a[i].first - a[j].first < k && j >= 1) j--;
    	dp[i] = max(dp[j]+a[i].second, dp[i-1]);
    	if (dp[i] == dp[i-1]) {
    		honnan[i] = {i-1, -1};
    	} else {
    		honnan[i] = {j, i};
    	}
    }
    cout << dp[n] << "\n";
    vector<int> res;
    for (int i = n; i != -1; i = honnan[i].first) {
    	if (honnan[i].second != -1) res.push_back(honnan[i].second);
    }
    
    cout << res.size() << " ";
    reverse(all(res));
    for (int i : res) cout << i << " ";

    return 0;
}