#include <bits/stdc++.h>
using namespace std;
const int c = 2 * 1e3;
typedef long long ll;

int dp[c], p[c];
pair<int, int> v[c];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n,k;
    cin >> n >> k;

    for(int i = 0; i < n; i++) {
        cin >> v[i].first >> v[i].second;
    }

    for(int i = 0; i < n; i++) {
        dp[i] = v[i].second;
        p[i] = i;
        for(int j = 0; j < i && v[j].first + k <= v[i].first; j++) {
            if(dp[i] < dp[j] + v[i].second) {
                dp[i] = dp[j] + v[i].second;
                p[i] = j;
            }
        }
    }
    int mo, maxi = 0;
    for(int i = 0; i < n; i++) {
        if(dp[i] > maxi) {
            maxi = dp[i];
            mo = i;
        }
    }

    stack<int> ki;
    int curr = mo;
    while(curr != p[curr]) {
        ki.push(curr+1);
        curr = p[curr];
    }
    cout << maxi << "\n" << ki.size() + 1 << " " << curr+1;
    while(!ki.empty()) {
        cout << " " << ki.top();
        ki.pop();
    }

    return 0;
}