#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

struct Station
{
    long long d;
    long long v;
    int idx;
};

int main()
{
    int n;
    long long k;
    cin >> n >> k;

    vector<Station> s(n);

    for (int i = 0; i < n; i++)
    {
        cin >> s[i].d >> s[i].v;
        s[i].idx = i + 1;
    }

    vector<long long> dist(n);
    for (int i = 0; i < n; i++)
    {
        dist[i] = s[i].d;
    }

    vector<int> prev(n);
    for (int i = 0; i < n; i++)
    {
        long long target = s[i].d - k;
        int j = (int)(upper_bound(dist.begin(), dist.end(), target) - dist.begin()) - 1;
        prev[i] = j;
    }

    vector<long long> dp(n);
    dp[0] = s[0].v;

    for (int i = 1; i < n; i++)
    {
        long long take = s[i].v;
        if (prev[i] != -1)
        {
            take += dp[prev[i]];
        }
        long long skip = dp[i - 1];
        dp[i] = max(take, skip);
    }

    vector<int> chosen;
    int i = n - 1;

    while (i >= 0)
    {
        long long skip = (i == 0 ? 0 : dp[i - 1]);
        long long take = s[i].v + (prev[i] == -1 ? 0 : dp[prev[i]]);

        if (take >= skip)
        {
            chosen.push_back(s[i].idx);
            i = prev[i];
        }
        else
        {
            i--;
        }
    }

    reverse(chosen.begin(), chosen.end());

    cout << dp[n - 1] << "\n";
    cout << chosen.size();
    for (int x : chosen)
    {
        cout << " " << x;
    }
    cout << "\n";
}