#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    int n,k;
    cin>>n>>k;
    vector<pair<int,int>> data(n);
    for(auto &x:data)cin>>x.first>>x.second;
    vector<int> dp(n+1);
    vector<vector<int>> path(n+1);
    path[0].push_back(0);
    dp[0]=data[0].second;
    for(int i=1;i<n;i++)
        {
        dp[i]=dp[i-1];
        if(dp[i]<data[i].second)
            {
            dp[i]=data[i].second;
            path[i]={i};
            }
        int j=i-1;
        while(j>-1 && data[j].first+k>data[i].first)j--;
        if(j>=0)
            {
            if(dp[i]<dp[j]+data[i].second)
                {
                dp[i]=dp[j]+data[i].second;
                path[i]=path[j];
                path[i].push_back(i);
                }
            else path[i]=path[i-1];
            }
        else path[i]=path[i-1];
        }
    cout<<dp[n-1]<<"\n";
    cout<<path[n-1].size();
    for(int x:path[n-1])cout<<" "<<x+1;
    return 0;
}