#include <iostream>
#include <fstream>
using namespace std;
struct munka
{
    int bevetel;
    int sorsz;
};
munka a[100000];

int main()
{
    int N, M, n, p, unap=0;
    //ifstream fin("be2.txt");
    cin>>N;
    cin>>M;
    for (int i=1; i<=M; i++)
    {
        cin>>n>>p;
        if(p>a[n].bevetel) { a[n].bevetel=p;
                             a[n].sorsz=i;}
        if (n>unap) unap=n;
    }
    int H[unap+1], elozo[unap+1];
    H[1]=a[1].bevetel;
    elozo[1]=0;
    int maxi=0, ind=0;
    for (int i=2; i<=unap; i++)
    {
        if (H[i-2]>maxi)
        {
            maxi=H[i-2];
            ind=i-2;
        }
        H[i]=maxi+a[i].bevetel;
        elozo[i]=ind;
    }
    int maxbevetel=0;
    ind=0;
    for (int i=1; i<=unap; i++)
    {
        if (H[i]>maxbevetel)
        {
            maxbevetel=H[i];
            ind=i;
        }
    }
    int i=ind, x=0;
    int elvallal[unap];
    while (i!=0)
    {
        elvallal[x]=a[i].sorsz;
        x++;
        i=elozo[i];
    }
    elvallal[x]=a[i].sorsz;
    //x++;
    cout<<maxbevetel<<" "<<x<<endl;
    for (int i=0; i<x; i++)
    {
        cout<<elvallal[i]<<" ";
    }
    return 0;
}