#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

ll n, k;
vector<ll> hely, ertek;
vector<vector<ll>> dp;
vector<vector<bool>> irany;

ll megold(ll ind, ll elozo){
    if(ind == n + 1){
        return 0;
    }
    if(dp[ind][elozo] != -1){
        return dp[ind][elozo];
    }

    ll a = megold(ind + 1, elozo), b = 0;
    if(hely[elozo] + k <= hely[ind]){
        b = megold(ind + 1, ind) + ertek[ind];
    }

    if(a <= b){
        irany[ind][elozo] = 1;
    }

    return dp[ind][elozo] = max(a, b);
}

int main()
{
    cin >> n >> k;

    hely.assign(n + 1, 0);
    ertek.assign(n + 1, 0);
    hely[0] = -1e9;
    for(ll i = 1; i <= n; i++){
        cin >> hely[i] >> ertek[i];
    }

    dp.assign(n + 1, vector<ll>(n + 1, -1));
    irany.assign(n + 1, vector<bool>(n + 1, 0));

    cout << megold(1, 0) << "\n";

    vector<ll> ans;
    ll egy = 1, ket = 0;
    while(egy <= n && ket <= n){
        if(ket >= egy){
            cout << egy << " " << ket << "\n";
        }
        assert(ket < egy);
        if(irany[egy][ket]){
            ans.push_back(egy);
            ket = egy;
            egy++;
        } else{
            egy++;
        }
    }

    cout << ans.size() << " ";
    for(ll x : ans) cout << x << " ";
    cout << "\n";
}