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.Comparator;
import java.util.Scanner;

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

        final int[] cards = new int[n];

        for (int i = 0; i < n; i++) {
            cards[i] = scanner.nextInt();
        }

        Arrays.sort(cards);
        final Cs[] cs = new Cs[m];
        final Main d = new Main();

        for (int i = 0; i < m; i++) {
            cs[i] = d.new Cs(scanner.nextInt(), scanner.nextInt());
        }

        Arrays.sort(cs, Comparator.reverseOrder());

        int counter = 0;

        for(int i = 0;i<m;i++){
            final int c = cs[i].getNum();
            final int ati = cs[i].getAtai();
            boolean f = false;
            for(int j = 0;j<c;j++){
                if (counter >= n || cards[counter] >= ati) {
                    f = true;
                    break;
                }

                cards[counter] = ati;
                counter++;
            }
            if(f){
                break;
            }
        }

        long result = 0;
        for (final int card : cards) {
            result += card;
        }

        System.out.println(result);
    }

    class Cs implements Comparable<Cs> {
        private final int num;
        private final int atai;

        public Cs(final int num, final int atai) {
            this.num = num;
            this.atai = atai;
        }

        public int getNum() {
            return num;
        }

        public int getAtai() {
            return atai;
        }

        @Override
        public int compareTo(final Cs cs) {
            return this.atai - cs.atai;
        }
    }
}
