#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;

int main() {

    int n, t;

    cin >> n >> t;


    vector <pair<int, int>> v;

    for (int i = 0; i < n; i++) {
        int a, b;

        cin >> a >> b;
        v.push_back(pair<int, int>(a + b, i + 1));
    }

    sort(v.begin(), v.end());

    int ans = 0;

    for (int i = 0; i < t; i++) {
        ans += v[i].first;
    }

    cout << ans << endl;
    vector <int> pos;
    for (int i = 0; i < t; i++) {
        pos.push_back(v[i].second);
    }

    sort(pos.begin(), pos.end());

    for (int i = 0; i < pos.size(); i++)
        cout << pos[i] << " ";


    return 0;
}