You have N cards. On the i-th card, an integer A_i is written.

For each j = 1, 2, ..., M in this order, you will perform the following operation once:

Operation: Choose at most B_j cards (possibly zero). Replace the integer written on each chosen card with C_j.

Find the maximum possible sum of the integers written on the N cards after the M operations.

Constraints

* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq M \leq 10^5
* 1 \leq A_i, C_i \leq 10^9
* 1 \leq B_i \leq N

Input

Input is given from Standard Input in the following format:


N M
A_1 A_2 ... A_N
B_1 C_1
B_2 C_2
\vdots
B_M C_M


Output

Print the maximum possible sum of the integers written on the N cards after the M operations.

Examples

Input

3 2
5 1 4
2 3
1 5


Output

14


Input

10 3
1 8 5 7 100 4 52 33 13 5
3 10
4 30
1 4


Output

338


Input

3 2
100 100 100
3 99
3 99


Output

300


Input

11 3
1 1 1 1 1 1 1 1 1 1 1
3 1000000000
4 1000000000
3 1000000000


Output

10000000001
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {
    public static void main(String[] args) throws Exception {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String[] nmarray = reader.readLine().split(" ");
        int n = Integer.parseInt(nmarray[0]);
        int m = Integer.parseInt(nmarray[1]);
        int[] a = new int[n];
        String[] arr = reader.readLine().split(" ");
        for (int i = 0; i < n; i++) {
            a[i] = Integer.parseInt(arr[i]);
        }
        Arrays.sort(a);
        BC[] bc = new BC[m];
        for (int j = 0; j < m; j++) {
            String[] bcarray = reader.readLine().split(" ");
            bc[j] = new BC(Integer.parseInt(bcarray[0]), Integer.parseInt(bcarray[1]));
        }
        Arrays.sort(bc);
        int index = 0;
        label: for (int j = 0; j < m; j++) {
            while (0 < bc[j].b && index < n) {
                if (a[index] < bc[j].c) {
                    a[index] = bc[j].c;
                    index++;
                    bc[j].b--;
                } else {
                    break label;
                }
            }
        }
        long sum = 0L;
        for (int i = 0; i < n; i++) {
            sum += a[i];
        }
        System.out.println(sum);
    }

    private static class BC implements Comparable<BC> {
        int b;
        int c;
        private BC(int b, int c) {
            this.b = b;
            this.c = c;
        }
        public int compareTo(BC o) {
            return this.c < o.c ? 1 : this.c == o.c ? 0 : -1;
        }
    }
}
