#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, -1);

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

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

    dp[1] = best_value[1];
    take[1] = (best_value[1] > 0);

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

    vector<int> ans;
    int idx = n;
    while (idx > 0) {
        if (take[idx]) {
            ans.push_back(best_id[idx]);
            idx -= 2;
        } else {
            idx--;
        }
    }

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

    cout << dp[n] << ' ' << ans.size() << '\n';
    for (int x : ans) cout << x << ' ';

    return 0;
}