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.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        int[] a = new int[n];
        long[] b = new long[m];
        int[] c = new int[m];
        for (int i = 0 ; i < n ; i++) {
            a[i] = sc.nextInt();
        }

        for (int i = 0 ; i < m ; i++) {
            b[i] = sc.nextInt();
            c[i] = sc.nextInt();
        }

        Map<Integer, Long> map = new HashMap<>();
        for (int i = 0 ; i < n ; i++) {
            if (map.containsKey(a[i])) {
                map.put(a[i], map.get(a[i]) + 1);
            } else {
                map.put(a[i], 1l);
            }
        }

        for (int i = 0 ; i < m ; i ++) {
            if (map.containsKey(c[i])) {
                map.put(c[i], (long) map.get(c[i]) + b[i]);
            } else {
                map.put(c[i], b[i]);
            }
        }
        Pair[] pairs = new Pair[map.size()];
        int index = 0;
        for (Entry<Integer, Long> entry : map.entrySet()) {
            Pair pair = new Pair();
            pair.from = entry.getKey();
            pair.end = entry.getValue();
            pairs[index] = pair;
            index++;
        }

        Arrays.sort(pairs);
        long sum = 0 ;
        int remain = n;
        for (int i = map.size() - 1 ; i >= 0 ; i--) {
            if (pairs[i].end < remain) {
                sum += (long) pairs[i].from * pairs[i].end;
                remain -= pairs[i].end;
                } else {
                    sum += (long) pairs[i].from * remain;
                    remain = 0;
                }

            if (remain == 0) break;
        }

        System.out.println(sum);


    }
}

class Pair implements Comparable {
    int from;
    long end;
    @Override
    public int compareTo(Object other) {
        Pair otherpair = (Pair) other;
        return from - otherpair.from;
    }
}