#include <iostream>
#include <vector>
#include <deque>

using namespace std;

struct adat
{
    int elott, tav, sum;
    bool epit;
};

int n, i, j, mintav;
deque <int> v;

int main()
{
    cin>>n>>mintav;
    vector <adat> x(n+1);

    for (i=1; i<=n; ++i)
    {
        cin>>x[i].tav>>x[i].sum;

        j=i-1;
        while (j>=1 && x[i].tav-x[j].tav<mintav)
        {
            --j;
        }

        if (x[j].sum+x[i].sum>x[i-1].sum)
        {
            x[i].epit=1;
            x[i].sum+=x[j].sum;
            if (x[j].epit) x[i].elott=j;
            else x[i].elott=x[j].elott;

            if (i==n) v.push_back(n);
        }else
        {
            x[i].sum=x[i-1].sum;
            if (x[i-1].epit) x[i].elott=i-1;
            else x[i].elott=x[i-1].elott;
            x[i].tav=x[i-1].tav;
        }
    }

    cout<<x[n].sum<<"\n";

    i=n;
    while (x[i].elott!=0)
    {
        v.push_front(x[i].elott);
        i=x[i].elott;
    }

    cout<<v.size()<<" ";
    for (auto &e:v)
    {
        cout<<e<<" ";
    }

    return 0;
}