#include<bits/stdc++.h>
using namespace std;

const int MAXT = 16, inf = 16'000'006;
int h,t,dp[MAXT][1<<MAXT],sumd[1<<MAXT],sumv[1<<MAXT],d[MAXT],v[MAXT];
vector<int> len;

int f(int pos,int mask){
    if(pos==len.size())return 0;
    
    int res = -inf;
    for(int i=mask;i>0;i=((i-1)&mask)){
        if(sumd[i]==len[pos]){
            res = max(res, sumv[i] + f(pos+1,mask^i));
        }
    }
    
    return res;
}

void solve(){
    cin>>h>>t;
    
    vector tmp(t+1,0);
    for(int i=0;i<h;i++){
        int c;
        cin>>c;
        if(c>t){
            cout<<"0\n";
            return;
        }
        
        for(int j=1;j<=c;j++){
            tmp[j]++;
        }
        for(int j=c+1;j<=t;j++){
            if(tmp[j]>0){
                len.push_back(tmp[j]);
                tmp[j]=0;
            }
        }
    }
    for(int j=1;j<=t;j++){
        if(tmp[j]>0){
            len.push_back(tmp[j]);
            tmp[j]=0;
        }
    }
    
    if(len.size()>t){
        cout<<"0\n";
        return;
    }
    
    for(int i=0;i<t;i++){
        cin>>d[i]>>v[i];
    }
    
    for(int i=0;i<(1<<t);i++){
        for(int j=0;j<t;j++){
            if(i&(1<<j)){
                sumd[i]+=d[j];
                sumv[i]+=v[j];
            }
        }
    }
    
    for(int i=len.size();i>=0;i--){
        for(int j=0;j<(1<<t);j++){
            dp[i][j]=f(i,j);
        }
    }
    
    
    if(dp[0][(1<<t)-1]<0)cout<<"0\n";
    else cout<<dp[0][(1<<t)-1]<<"\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int t=1;
    //cin>>t;
    for(int i=1;i<=t;i++)solve();
    
    return 0;
}