//完全背包问题(01思路)
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int f[26][30001];
int c[26];
int w[26];
int main()
{
int n,v,i,j,k;
for(;;)
{
cin>>v>>n;
memset(f,0,sizeof(f));
for(i=1;i<=n;i++)
{
cin>>c[i]>>w[i];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=v;j++)
{
for(k=0;k<=(j/c[i]);k++)
{
if(j>=(k*c[i]))
f[i][j]=max(f[i][j],f[i-1][j-k*c[i]]+k*w[i]*c[i]);
}
}
}
cout<<f[n][v]<<endl;
}
return 0;
}