#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n,k,a,b; cin >> n >> k;
    vector <pair <int,int>> v(n);
    for(int i = 0; i < n; i++){
        cin >> a >> b;
        v[i] = {a,b};
    }
    long long haszon = 0, tav = 0;
    int elozo = 0,azelotti = 0;
    vector <int> dp;
    vector <int> kutak;
    dp.push_back(v[0].second);
    tav = v[0].first;
    for(int i = 1; i < n; i++){
        if(v[i].first - tav < k){
            if(dp[dp.size()-1] - haszon >= v[i].second){
                //kutak.push_back(azelotti);
            }else{

                dp.push_back(v[i].second + haszon);
                tav = v[i].first;
                haszon = dp[dp.size()-2];
                kutak.push_back(azelotti);
                azelotti = elozo;
                elozo = i;
            }
        }else{

            dp.push_back(v[i].second + haszon);
            tav = v[i].first;
            haszon = dp[dp.size()-2];
            kutak.push_back(azelotti);
            azelotti = elozo;
            elozo = i;
        }
    }
    kutak.push_back(elozo);
    cout << dp[dp.size()-1] << '\n' << kutak.size()-2 << ' ';
    for(int i = 0; i < kutak.size(); i++){
        if(i > 1){
            cout << kutak[i]+1 << ' ';
        }
    }

}