#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#pragma optimize(03)
using namespace std;

struct meg {
    int nap;
    int hasz;
    int sorszam;
};

bool h(meg a, meg b) {
    if (a.nap == b.nap) return a.hasz < b.hasz;
    else return a.nap < b.nap;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, m;
    cin >> n >> m;

    vector<meg> v(m);
    for (int i = 0; i < m; i++) {
        cin >> v[i].nap >> v[i].hasz;
        v[i].sorszam = i;
    }


    sort(v.begin(), v.end(), h);
    for (int i = 0; i < (int)v.size() - 1; i++) {
        if (v[i].nap == v[i + 1].nap) {
            v.erase(v.begin() + i);
            i--;
        }
    }


    for (int i = 0; i < (int)v.size() - 1; i++) {
        if (v[i + 1].nap - v[i].nap > 1) {
            v.insert(v.begin() + i + 1, {v[i].nap + 1, 0, -1});
        }
    }

    vector<int> dp(v.size());
    vector<bool> is(v.size(), false);
    vector<int> previ(v.size(), -1);

    for (int i = 0; i < v.size(); i++) {

        int elozo = (i > 0) ? dp[i - 1] : 0;


        int ketto_ezelott = (i > 1) ? dp[i - 2] : 0;

        int aktualis_opcio = v[i].hasz + ketto_ezelott;

        if (aktualis_opcio > elozo) {
            dp[i] = aktualis_opcio;
            is[i] = true;
            previ[i] = i - 2;
        } else {
            dp[i] = elozo;
            is[i] = false;
        }
    }



    if (v.empty()) {
        cout << "0 0" << endl;
        return 0;
    }

    cout << dp.back() << " ";


    vector<int> napok;
    int most = v.size() - 1;


    while (most >= 0) {
        if (is[most]) {

            if (v[most].hasz > 0) {
                napok.push_back(v[most].sorszam + 1);
            }
            most = previ[most];
        } else {
            most--;
        }
    }

    cout << napok.size() << endl;
    for (int i = napok.size() - 1; i >= 0; i--) {
        cout << napok[i] << " ";
    }

    return 0;
}