#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n,k;
    cin>>n>>k;
    vector<pair<int,int>>kutak(n+1,{0,0});  //tav , haszon
    vector<int>dp(n+1,0);
    vector<int>szulo(n+1,0);
    for(int i=1;i<=n;i++)
    {
        cin>>kutak[i].first>>kutak[i].second;
    }
    dp[1]=kutak[1].second;
    for(int i=2;i<=n;i++)
    {
        dp[i]=kutak[i].second;
        for(int j=i-1;j>=1;j--)
        {
            if(kutak[i].first-kutak[j].first>=k)
            {
                if(dp[j]+kutak[i].second > dp[i])
                {
                    dp[i]=dp[j]+kutak[i].second;
                    szulo[i]=j;
                }
            }
        }
    }
    int utso=1;
    for(int i=2;i<=n;i++)
    {
        if(dp[i]>dp[utso])
        {
            utso=i;
        }
    }
    cout<<dp[utso]<<"\n";
    stack<int>mo;
    mo.push(utso);
    while(szulo[utso]!=0)
    {
        mo.push(szulo[utso]);
        utso=szulo[utso];
    }
    cout<<mo.size()<<" ";
    while(!mo.empty())
    {
        cout<<mo.top()<<" ";
        mo.pop();
    }

    return 0;
}