#include <iostream>
#include<vector>

using namespace std;

int main()
{
    int n, m, x, y;
    cin >> n >> m;
    vector<int> poz(n + 1), haszon(n + 1, 0);
    for(int i = 1; i <= m; i++)
    {
        cin>> x >> y;
        if(haszon[x] < y)
        {
            haszon[x] = y;
            poz[x] = i;
        }
    }
    vector<int> maxh(n + 1);
    vector<bool> elvegez(n + 1, false);
    elvegez[1] = true;
    maxh[1] = haszon[1];
    maxh[0] = 0;
    for(int i = 2; i <= n; i++)
    {
        if(haszon[i] + maxh[i - 2] > maxh[i - 1])
        {
            elvegez[i] = true;
            maxh[i] = haszon[i] + maxh[i - 2];
        }
        else
        {
            maxh[i] = maxh[i - 1];
        }
    }
    cout << maxh[n] << " ";
    vector<int> e;
    int i = n;
    while(i > 0)
    {
        if(elvegez[i])
        {
            e.push_back(poz[i]);
            i = i - 2;
        }
        else
        {
            i--;
        }
    }
    cout << e.size() <<endl;
    for(int i = e.size() - 1; i >= 0; i--)
    {
        cout << e[i] << " ";
    }
    return 0;
}