// UUID: 7b245455-db3d-4e23-a73b-53eec8f2f8ec
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, k;
    cin >> n >> k;
    vector<pair<long long, long long>> dis(n+1);
    for(int i = 1; i <= n; i++){
        cin >> dis[i].first >> dis[i].second;
    }
    dis[0].first = dis[1].first - k;
    dis[0].second = 0;

    vector<long long> dp(n+1);
    vector <vector<int>> ans(n+1);
    dp[0] = 0;
    for(int i = 1; i <= n; i++){
        for(int j = i-1; j >-1; j--){
            if(dis[i].first - dis[j].first >= k){
                dp[i] = max(dp[i-1], dp[j] + dis[i].second);
                if(dp[i-1] < dp[j] + dis[i].second){
                    ans[i] = ans[j];
                    ans[i].push_back(i);
                }
                else{
                    ans[i] = ans[i-1];
                    }
                    break;
                }
            }
        }
         cout << dp[n] << "\n" << ans[n].size();
        for(int x : ans[n]){
            cout << " " << x;
        }
}