#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, m;

    cin >> n >> m;
    vector<int> best_value(n + 1, 0), best_id(n + 1, -1e9), dp(n + 1, -1e9), prev(n + 1, -1e9);


    for (int i=1; i <=  m; i++) {
        int u, v;
        cin >> u >> v;
        if (best_value[u] < v) {
            best_value[u] = v;
            best_id[u] = i;
        }
    }

    dp[0] = 0;
    dp[1] = best_value[1];

    int idx = 1;

    for (int i=2; i <= n; i++) {
        if (dp[i - 2] + best_value[i] > dp[i - 1]) {
            prev[i] = i - 2;
            dp[i] = dp[i - 2] + best_value[i];
        } else {
            prev[i] = i-1;
            dp[i] = dp[i - 1];
        }
        if (dp[i] > dp[idx]) {
            idx = i;
        }
    }

    cout << dp[idx] << ' ';

    vector<int> ans(0);

    while (idx > 0) {
        if (prev[idx] != idx - 1) {
            ans.push_back(best_id[idx]);
        }
        idx = prev[idx];
    }

    cout << ans.size() << '\n';

    for (int i=ans.size() - 1; i >= 0; i--) {
        cout << ans[i] << ' ';
    }

    return 0;
}