#include<bits/stdc++.h>
using namespace std;
double v;
double zhong[20],qian[20];
int d;
int ans=0;
vector<int>aaa;
int c[21]={0};
void dfs(int aa,double bb,double cc){
    if(aa>d)
    {
        if(cc>ans)
        ans=cc;
        for(int t=0;t<aaa.size();t++)
        c[t]=aaa[t];
        aaa.pop_back();
        return;
    }
    if(zhong[aa]<=v)
	{
	dfs(aa+1,bb-zhong[aa],cc+qian[aa]);
	aaa.push_back(aa);
	}
    dfs(aa+1,bb,cc);
}
int main()
{
    cin>>v>>d;
    for(int i=0;i<d;i++)
    cin>>zhong[i]>>qian[i];
    dfs(0,v,0);
    cout<<ans;
    sort(c,c+20);
    for(int j=0;j<21;j++)
    {
    	if(c[j]==0)
    	continue;
    	cout<<c[j];
	}
}