#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;
            }
        }
    vector<long long>dp(n+1,0);
    vector<int> backtrack(n+1,0);
    dp[1]=data[1].first;
    vector<bool> choose(n+1,true);
    for(int i=2;i<=n;i++)
        {
        if(dp[i-1]>dp[i-2]+data[i].first)
            {
            choose[i]=false;
            backtrack[i]=i-1;
            dp[i]=dp[i-1];
            }
        else
            {
            backtrack[i]=i-2;
            dp[i]=dp[i-2]+data[i].first;
            }
        }
    cout<<dp[n];
    int i=n;
    vector<int> ans;
    while(backtrack[i])
        {
        if(choose[i] && data[i].second!=0)ans.push_back(data[i].second);
        i=backtrack[i];
        }
    if(choose[i] && data[i].second!=0)ans.push_back(data[i].second);
    //reverse(ans.begin(),ans.end());
    cout<<" "<<ans.size()<<endl;
    for(int i=ans.size()-1 ;i>-1;i--)
        {
        cout<<ans[i]<<" ";
        }
    return 0;
}