#include <iostream>
#include <vector>
using namespace std;

struct RestStop {
    int distance;
    int profit;
};

int main() {
    int N, K;
    cin >> N >> K;

    vector<RestStop> restStops(N);
    for (int i = 0; i < N; i++) {
        cin >> restStops[i].distance >> restStops[i].profit;
    }

    long long maxProfit = 0;
    vector<int> locations;

    int currentLocation = 0;
    long long currentProfit = 0;

    for (int i = 0; i < N; i++) {
        int distance = restStops[i].distance - currentLocation;
        currentLocation = restStops[i].distance;

        if (distance >= K) {
            // Build a gas station at the current location
            maxProfit += currentProfit;
            currentProfit = 0;
            locations.push_back(currentLocation);
        }

        currentProfit = max(currentProfit, (long long)restStops[i].profit);
    }

    maxProfit += currentProfit;

    cout << maxProfit << endl;
    cout << locations.size() << " ";
    for (int i = 0; i < locations.size(); i++) {
        cout << locations[i] << " ";
    }

    return 0;
}