#include <iostream>
#include <vector>
using namespace std;

int main()
{
    int n, m;
    cin >> n >> m;
    vector<long long> bevetelek(n + 1, 0);
    vector<int> munkaid(n + 1, -1);
    vector<long long> dp(n + 1, 0);

    for (int i = 1; i <= m; i++) {
        int a; long long h;
        cin >> a >> h;
        if (h > bevetelek[a]) {
            bevetelek[a] = h;
            munkaid[a] = i;
        }
    }

    dp[0] = 0;
    dp[1] = max(0LL, bevetelek[1]);
    for (int i = 2; i <= n; i++) dp[i] = max(dp[i - 1], dp[i - 2] + bevetelek[i]);

    long long best = dp[n];
    vector<int> kiv;
    int j = n;

    while (j >= 1) {
        if (j == 1) {
            if (dp[1] > 0 && munkaid[1] != -1) kiv.push_back(munkaid[1]);
            break;
        }
        if (dp[j] == dp[j - 1]) j--;
        else {
            if (munkaid[j] != -1) kiv.push_back(munkaid[j]);
            j -= 2;
        }
    }

    cout << best << ' ' << kiv.size() << '\n';
    if (!kiv.empty()) {
        for (int x = (int)kiv.size() - 1; x >= 0; x--) {
            cout << kiv[x] << " ";
        }
    }
    cout << "\n";
}