#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n, k;cin >> n>> k;
    vector<int>d(n+1);
    vector<int>h(n+1);
    for(int i=1;i<=n;i++)
    {
        cin >> d[i] >> h[i];
    }
    vector<int>dp(n+1);
    vector<bool>use(n+1);
    dp[1] = h[1];
    use[1] = 1;
    for(int i=2;i<=n;i++)
    {
        int prev = 0;
        for(int j=i-1;j>0;j--)
        {
            if(d[i]-d[j] >= k) 

            {
                prev = j;
                break;
            }
        }
        if(dp[i-1] > dp[prev] + h[i])
        {
            dp[i] = dp[i-1];
        }
        else
        {
            dp[i] = dp[prev] + h[i];
            use[i] = 1;
        }
    }
    cout << dp[n]<<endl;
    vector<int>use2;
    int cnt=0;
    int i=n;
    while(i>0)
    {
        if(use[i])
        {
            cnt++;
            use2.push_back(i);
            int prev = 0;
            for(int j=i-1;j>0;j--)
            {
                if(d[i]-d[j] >= k) 

                {
                    prev = j;
                    break;
                }
            }
            i = prev;
        }
        else i--;
    }
    cout <<cnt;
    reverse(use2.begin(), use2.end());
    for(auto i : use2)
    {
        cout << " " << i;
    }
}