#include <bits/stdc++.h>

using namespace std;

int main() {
    int n, k;
    cin >> n >> k;
    vector<pair<int,int>> v(n);
    map<int, int> pei;
    for (int i = 0; i < n; i++) {
        int a, b; cin >> a >> b;
        v[i] = {a, b};
        pei[a] = i+1;
    }
    int dmax = v[n-1].first;
    vector<int> dp(dmax+1, 0);
    vector<bool> bd(dmax+1, false);
    int ind = 0;
    for (int i = 1; i <= dmax; i++) {
        dp[i] = dp[i-1];
        if (i == v[ind].first) {
            if (dp[i] < dp[max(i-k,0)] + v[ind].second) {
                dp[i] = dp[max(i-k,0)] + v[ind].second;
                bd[i] = true;
            }
            ind++;
        }   
    }
    vector<int> loc;
    for (int i = dmax; i > 0; i--) {
        if (bd[i]) {
            loc.push_back(pei[i]);
            i -= k - 1;
        }
    }
    cout << dp[dmax] << '\n';
    reverse(loc.begin(), loc.end());
    cout << loc.size() << ' ';
    for (int i : loc)
        cout << i << ' ';
    cout << '\n';
    return 0;
}