#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<int> dp(n + 1);

    dp[1] = best[1].first;

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

    vector<int> ans;

    int i = n;
    while(i > 0)
    {
        if(dp[i] != dp[i - 1])
        {
            ans.push_back(best[i].second);
            i -= 2;
        }else
        {
            i--;
        }
    }

    cout << dp[n] << " " << (int)ans.size() << "\n";

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

    return 0;
}