#include <iostream>
#include <vector>
#include <stack>

using namespace std;

int main()
{
    int n, k, i, j;
    cin >> n >> k;

    vector<pair<int, int>> places(n);

    for (i = 0; i < n; i++)
    {
        cin >> places[i].first >> places[i].second; //dist, profit
    }

    vector<int> opt(n); // profit
    vector<int> last(n, -1);

    for (i = 0; i < n; i++)
    {
        int max = 0, maxi = -1;
        for (j = 0; j < i; j++)
        {
            if (max < opt[j] && places[j].first + k <= places[i].first)
            {
                max = opt[j];
                maxi = j;
            }
        }

        last[i] = maxi;
        opt[i] = max + places[i].second;
    }

    int max = 0, maxi = 0;
    for (j = 0; j < i; j++)
    {
        if (max < opt[j])
        {
            max = opt[j];
            maxi = j;
        }
    }

    cout << max << endl;

    int node = maxi;
    stack<int> reverse;

    while (node != -1)
    {
        reverse.push(node);
        node = last[node];
    }

    cout << reverse.size();

    while (reverse.size() > 0)
    {
        cout << ' ' << reverse.top() + 1;
        reverse.pop();
    }
}