//经典贪心
#include<iostream>
#include<algorithm>using namespace std;
struct Bao
{
int p, m;
}b[100];
bool cmp(Bao&a, Bao&b)
{
return(a.p > b.p);
}
int main(void)
{
int v, n, get;
while (cin >> v&&v)
{
cin >> n;
get = 0;
for (int i = 0; i < n; i++)
{
cin >> b[i].p >> b[i].m;
}
sort(b, b + n, cmp);
for (int i = 0; i < n; i++)
{
if (v >= b[i].m)
{
v -= b[i].m;
get += b[i].p*b[i].m;
}
else
{
get += b[i].p*v;
break;
}
}
cout << get << endl;
}
return 0;
}