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

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, k;
    cin >> n >> k;
    vector<long long> dp(1000001, 0);
    vector<int> prev(1000001, 0);
    for (int i=0; i < n; i++) {
        int u, v;
        cin >> u >> v;
        dp[u] = v;
    }
    for (int i=1; i <= 1000000; i++) {
        long long best = dp[i];
        if (i - k > 0) {
            best += dp[i - k];
        }
        if (best > dp[i - 1]) {
            dp[i] = best;
            prev[i] = max(i - k, 0);
        } else {
            dp[i] = dp[i - 1];
            prev[i] = prev[i - 1];
        }
    }
    vector<int> res;
    int i = n + 1;
    while (i > 0) {
        res.push_back(i);
        i = prev[i];
    }
    reverse(res.begin(), res.end());
    cout << dp[1000000] << '\n';
    cout << res.size() << ' ';
    for (int x : res) cout << x << ' ';
    cout << '\n';
    return 0;
}