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

using namespace std;

struct munka {
    int id;
    int penz;
};

int main()
{
    int n, m;
    cin >> n >> m;
    vector<munka> napok(n + 1, {0, 0});

    for(int i = 0; i < m; i++)
    {
        int nap, penz;
        cin >> nap >> penz;

        if (penz > napok[nap].penz) {
            napok[nap].penz = penz;
            napok[nap].id = i + 1;
        }
    }

    vector<long long> dp(n + 1, 0);

    dp[0] = 0;
    if (n >= 1) dp[1] = napok[1].penz;

    for(int i = 2; i <= n; i++)
    {
        long long opa = dp[i-1];
        long long opb = (long long)napok[i].penz + dp[i-2];

        dp[i] = max(opa, opb);
    }
    cout << dp[n];
    vector<int> kiv;
    int most = n;
    while(most > 0)
    {

        long long prev2 = (most >= 2) ? dp[most-2] : 0;

        if (napok[most].penz > 0 && dp[most] == napok[most].penz + prev2) {
            kiv.push_back(napok[most].id);
            most -= 2;
        } else {
            most -= 1;
        }
    }

    cout << " " << kiv.size() << endl;
    for(int id : kiv) {
        cout << id << " ";
    }
    cout << endl;

    return 0;
}