#include <iostream>
using namespace std;
int best[1000001]{ 0 },benzinkutak[1000001]{ 0 }, jok[1000001]{ 0 };
int main()
{
    int n, k,maxi=0;
    cin >> n >> k;
    int t[1001], h[1001];
    for (int i = 1; i <= n; i++) 
    {
        cin >> t[i] >> h[i];
        if (t[i] >= maxi)
            maxi = t[i];
        benzinkutak[t[i]] = i;
    }
    for (int i = 1; i <= maxi; i++)
    {
        best[i] = best[i - 1];
        if (benzinkutak[i] != 0) 
        {
            //best[i] = max(best[i], best[i - k] + h[benzinkutak[i]]);
            if (best[i] < best[i - k] + h[benzinkutak[i]]) {
                best[i] = best[i - k] + h[benzinkutak[i]];
                jok[i] = benzinkutak[i];
            }

        }
    }
    cout << best[maxi] << endl;
    int megoldas[1001], db = 0;
    int i = maxi;
    while (i > 0) {
        if (jok[i] == 0)
            i--;
        else {
            db++;
            megoldas[db] = jok[i];
            i = i - k;
        }   
    }
    cout << db << " ";
    for (int i = db; i >= 1; i--) {
        cout << megoldas[i] << " ";
    }
}