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.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt(),m=sc.nextInt();
		ArrayList<Integer> array = new ArrayList<Integer>();
		for(int i=0;i<n;i++) array.add(sc.nextInt());
		Collections.sort(array);
		int[][] array2 = new int[m][2];
		for(int i=0;i<m;i++) {
			array2[i][1]=sc.nextInt();
			array2[i][0]=sc.nextInt();
		}
		sc.close();
		Arrays.sort(array2,(a,b)->Integer.compare(a[0],b[0]));
		int temp=0,now1=n-1,now2=m-1;
		long ans=0;
		while(temp<n) {
			if(now2<0 || array.get(now1)>array2[now2][0]) {
				ans+=array.get(now1);
				now1--;
			}else {
				ans+=array2[now2][0];
				array2[now2][1]--;
				if(array2[now2][1]==0)  now2--;
			}
			temp++;
		}
		System.out.println(ans);
	}
}