#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, k;
    cin >> n >> k;
    vector<int>dp(n + 1, 0);
    vector<int>tavok;
    vector<int>res;
    for (int i = 1; i <= n; i++)
    {
        int t,h; cin >> t>>h;
        tavok.push_back(t);
        if (t - k < 0)
        {
            dp[i] = max(dp[i - 1], h);
        }
        else
        {
            auto x = lower_bound(tavok.begin(), tavok.end(), (t - k));
            dp[i] = max(dp[i - 1], h + dp[x - tavok.begin()]);
        }
    }
    int j = n,x;
    while (j > 0)
    {
        if (dp[j] == dp[j - 1])
            j--;
        else
        {
            res.push_back(j);
            x = j - 1;
            while (x > 0 and dp[j - 1] - dp[x - 1] < k)
                x--;
        }
        j = x;
    }
    reverse(res.begin(), res.end());
    cout << dp[n] << endl;
    cout << res.size() << " ";
    for (auto x : res)
        cout << x << " ";
}