#include <stdio.h>
int find(int a[], int n) {
    int max = a[0], r = 0;
    for (int i = 1; i < n; i++) {
        if (a[i] > max) {
            max = a[i];
            r = i;
        }
    }
    return r;
}
int main() {
    int find(int a[], int n);
    int v, n;
    scanf("%d %d", &v, &n);
    int a[n], b[n];
    for (int i = 0; i < n; i++) {
        scanf("%d %d", &a[i], &b[i]);
    }
    int value = 0;
    while (1) {
        int j = find(b, n);
        int temp = b[j];
        b[j] = 0;
        if (v - a[j] > 0) {
            v = v - a[j];
            value = value + temp * a[j];
            continue;
        } else {
            value = value + v * temp;
            break;
        }
    }
    printf("%d", value);
    return 0;
}