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.Scanner;
public class Main {
	public static void main(String[] args){
		Scanner stdIn=new Scanner(System.in);
		int N=stdIn.nextInt();
		int M=stdIn.nextInt();
		int A[]=new int[N];
		int sum[][]=new int[M][2];
		int z=0,x=0,y=0,max=0;
		long ans=0;
		while(z<N){
			A[z]=stdIn.nextInt();
			z++;
		}z=0;
		Arrays.sort(A);
		while(z<M){
			sum[z][1]=stdIn.nextInt();
			sum[z][0]=stdIn.nextInt();
			z++;
		}z=0;
		Arrays.sort(sum, (a, b) -> Long.compare(a[0], b[0]));
		while(z<N){
			if(x!=M)
				if(A[z]<sum[M-x-1][0]&&y==0){
					y=sum[M-x-1][1];
					x++;	
				}
			if(x==0)
				max=1;
			if(A[z]>=sum[M-x-max][0]||y==0)
				ans+=A[z];
			else{
				ans+=sum[M-x-max][0];
				y--;
			}
			max=0;
			z++;
		}
		System.out.println(ans);
	}
}