#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF int(1e9+1)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define F(n) FOR(i,0,n)
#define FF(n) FOR(j,0,n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX 22
#define FL (puts("0"),exit(0))
int dp[1<<MX],P[MX],K[MX],A[1<<17],N,L,X,I,B[MX];
void add(int s){
    if(!s)return;
    if(I==L)FL;
    B[I++]=s;
}
int dyn(int b,int x,int y){
    if(x==I)return 0;
    int&v=dp[b];
    if(v>=-INF)return v;
    v=-INF;
    F(L)if(!(b&1<<i)&&y+K[i]<=B[x]){
        if(K[i]+y==B[x])v=max(v,dyn(b|1<<i,x+1,0)+P[i]);
        else v=max(v,dyn(b|1<<i,x,y+K[i])+P[i]);
    }
    return v;
}
int main(void){
    scanf("%d%d",&N,&L),ga(N,A),X=*max_element(A,A+N),fill(dp,dp+(1<<MX),-INF-666);
    F(L)scanf("%d%d",K+i,P+i);
    FT(1,X+1){
        int l=0;
        F(N)if(A[i]>=k)++l;
            else add(l),l=0;
        add(l);
    }
    sort(B,B+I);//Not neccessary
    printf("%d\n",max(0,dyn(0,0,0)));
    return 0;
}