#include <iostream>
#include <vector>
#define ll long long
using namespace std;

//ifstream cin ("input.in");
//ofstream cout ("output.out");

ll n,m,i,j,a,b,k;
struct element
{
    ll best,before,dis;
    bool ok;
};

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

    cin>>n>>k;
    vector <element> dp(n+1);
    for (i=1;i<=n;++i)
    {
        cin>>a>>b;
        dp[i].dis=a;
        if (i==1)
        {
            dp[i].best=b;
            dp[i].before=i;
            dp[i].ok=true;
            continue;
        }
        dp[i].best=b,dp[i].before=i,dp[i].ok=true;
        j=i-1;
        while (j>=1&&a-dp[j].dis<k)
        {
            if (dp[i].best<dp[j].best)
            {
                dp[i].best=dp[j].best;
                dp[i].before=j;
                dp[i].ok=false;
            }
            j--;
        }
        if (j!=0)
        {
            if (dp[j].best+b>dp[i].best)
            {
                dp[i].best=dp[j].best+b;
                dp[i].before=j;
                dp[i].ok=true;
            }
        }

    }
    cout<<dp[n].best<<"\n";
    vector <ll> res(1);
    i=n;
    if (dp[n].ok) res.push_back(n);
    while (dp[i].before!=i)
    {
        i=dp[i].before;
        if (dp[i].ok) res.push_back(i);
    }
    cout<<res.size()-1<<" ";
    for (i=res.size()-1;i>0;--i) cout<<res[i]<<" ";
}