#include <bits/stdc++.h>  
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
 
int main()
{
    //ifstream cin("in.txt");
    int n, k;
    cin >> n >> k;
    
    vector<int> d(n + 1);
    vector<int> p(n + 1);

    for(int i = 1; i <= n; i++){
        cin >> d[i] >> p[i];
    }

    vector<int> dp(n + 1);
    vector<int> anc(n + 1);
    vector<int> jump(n + 1);


    for(int i = 1; i <= n; i++){
        int j = i - 1;
        while(j >= 1 && d[i] - d[j] < k){
            j--;
        }
        if(dp[i - 1] > dp[j] + p[i]){
            dp[i] = dp[i - 1];
            if(jump[i - 1] == 0){
                jump[i] = i - 1;
            }
            else{
                jump[i] = jump[i - 1];
            }
        }
        else{
            dp[i] = dp[j] + p[i];
            anc[i] = j;
        }
    }

    cout << dp[n] << '\n';
    stack<int> s;
    int i = n;
    while(i > 0){
        if(anc[i] == 0 && jump[i] != 0){
            i = jump[i];
        }
        else{
            s.push(i);
            i = anc[i];
        }
    }
    cout << s.size() << " ";
    while(!s.empty()){
        cout << s.top() << " ";
        s.pop();
    }


    
}