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

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

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

    dp[0] = 0;
    dp[1] = bevetelek[1];
    choice[1] = (bevetelek[1] > 0);

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

    long long best = dp[n];
    vector<int> chosen;
    int i = n;

    while (i >= 1) {
        if (choice[i] && munkaid[i] != -1) {
            chosen.push_back(munkaid[i]);
            i -= 2;
        }
        else {
            i -= 1;
        }
    }

    cout << best << " " << chosen.size() << "\n";
    for (int x : chosen) cout << x << " ";
}