#include <bits/stdc++.h>
using namespace std;

#define int long long

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

    vector<array<int, 2> > a(n+1);

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

    vector<array<int, 3> > dp(n+1);

    dp[0][0] = 0;

    for(int i = 1; i <= n; i++) {
        dp[i][0] = a[i][1];
        for(int j = i-1; j >= 1; j--) {
            if(a[i][0] - a[j][0] >= k && dp[i][0] < dp[j][0] + a[i][1]) {
                dp[i][0] = dp[j][0] + a[i][1];
                dp[i][1] = dp[j][1] + 1;
                dp[i][2] = j;
            }
        }
    }

    int maxdp = 0, maxi = 0;

    for(int i = 1; i <= n; i++) {
        if (maxdp < dp[i][0]) {
            maxdp = dp[i][0];
            maxi = i;
        }
    }

    cout << dp[maxi][0] << endl;
    cout << dp[maxi][1] + 1 <<  ' ';
    vector<int> ansv;
    ansv.push_back(maxi);
    int i = maxi;
    while(dp[i][2] != 0) {
        ansv.push_back(dp[i][2]);
        i = dp[i][2];
    }
    sort(ansv.begin(), ansv.end());
    for(int x : ansv) cout << x << ' ';
}