#include <iostream>
#include <vector>

using namespace std;

struct dph
{
int take;
int bestp;
vector<int> taker;
vector<int> bestpr;
};

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n,m;
    cin>>n>>m;
    vector<pair<int,int>> data(n+1,{0,0});
    int x,y;
    for(int i=1;i<=m;i++)
        {
        cin>>x>>y;
        if(y>data[x].first)
            {
            data[x].first=y;
            data[x].second=i;
            }
        }
    dph curr,prev;
    curr.take=data[1].first;
    curr.taker.push_back(data[1].second);
    curr.bestp=0;
    for(int i=2;i<=n;i++)
        {
        prev=curr;
        curr.take=prev.bestp+data[i].first;
        curr.taker=prev.bestpr;
        if(data[i].second!=-1)
            curr.taker.push_back(data[i].second);

        if(prev.bestp>prev.take)
            {
            curr.bestp=prev.bestp;
            curr.bestpr=prev.bestpr;
            }
        else
            {
            curr.bestp=prev.take;
            curr.bestpr=prev.taker;
            }
        }
    if(curr.bestp>curr.take)
        {
        cout<<curr.bestp<<" ";
       
        cout<<curr.bestpr.size()<<endl;
        for(auto x : curr.bestpr)
            {
            if(x>0)
                {
                cout<<x<<" ";
                }
            }
        }
    else
        {
        cout<<curr.take<<" ";
        
        cout<<curr.taker.size()<<endl;
        for(auto x : curr.taker)
            {
            if(x>0)
                {
                cout<<x<<" ";
                }
            }
        }

    //for(auto x : curr.taker)
       // {
       // cout<<x<<" ";
       // }
    return 0;
}