#include <iostream>
#include <bits/stdc++.h>

using namespace std;

int main()
{
  int n,k;
  cin >> n >> k;
  vector<pair<int,int>> v(n+1);
  vector<int> maxi(n+1);
  vector<vector<int>> helyek(n+1);
  v[0].first=0;
  v[0].second=-1000000;
  for (int i=1; i<=n; i++) {
    cin >> v[i].first;
    cin >> v[i].second;
    int a=1;
    int b=n;
    while (b-a>1) {
        int c=(a+b)/2;
        if (v[i].first-v[c].first>=k) {
            a=c;
        }
        else {
            b=c;
        }
    }
    int dp=maxi[a]+v[i].second;
    if (maxi[i-1]<dp) {
        maxi[i]=dp;
        helyek[i]=helyek[a];
        helyek[i].push_back(i);
    }
    else {
        maxi[i]=maxi[i-1];
        helyek[i]=helyek[i-1];
    }
  }
  cout << maxi[n] << "\n";
  cout << helyek[n].size() << " ";
  for (int i:helyek[n]) {
    cout << i << " ";
  }
}