#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;
    vector <int> tav(n+1), h(n+1), maxh(n+1);
    vector <bool> epit(n+1);
    vector <int> index;
    for(int i=1;i<=n;i++)
    {
        cin >> tav[i] >> h[i];
    }

    maxh[1] = h[1];
    epit[1] = true;
    int j;
    for(int i=2;i<=n;i++)
    {
        j=i-1;
        while (j>=1 && tav[i]-tav[j] < k)
        {
            j--;
        }
        if(maxh[i-1] > maxh[j] + h[i])
        {
            maxh[i] = maxh[i-1];
        }
        else
        {
            maxh[i] = maxh[j] + h[i];
            epit[i] = true;
        }
    }

    cout << maxh[n]<<endl;
    int i=n;
    while(i>0)
    {
        if(epit[i])
        {
            index.push_back(i);
            j=i-1;
            while (j>=1 && tav[i]-tav[j] < k)
            {
               j--;
            }
            i = j;
        }
        else i--;
    }
    cout <<index.size() << " ";
    for (auto it=index.end()-1; it>=index.begin(); it--)
    {
        cout << *it << " ";
    }
    return 0;
}