#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n, m;
    cin >> n >> m;

    vector<pair<int, int>> best(n + 1);

    for(int i = 1; i <= m; i++)
    {
        int d, m;
        cin >> d >> m;

        if(m > best[d].first)
        {
            best[d].first = m;
            best[d].second = i;
        }
    }

    vector<vector<int>> dp(n + 1, vector<int>(2));
    vector<vector<char>> from(n + 1, vector<char>(2, -1));

    for(int i = 1; i <= n; i++)
    {
        dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]);
        dp[i][1] = dp[i - 1][0] + best[i].first;

        if(dp[i - 1][0] >= dp[i - 1][1]) from[i][0] = 0;
        else from[i][0] = 1;

        from[i][1] = 0;
    }

    vector<int> ans;

    int state = 0;
    if(dp[n][0] < dp[n][1]) state = 1;

    for(int i = n; i >= 1; i--)
    {
        if(state) ans.push_back(best[i].second);

        state = from[i][state];
    }

    cout << max(dp[n][0], dp[n][1]) << " " <<  (int)ans.size() << "\n";

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

    return 0;
}