#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int INF = 1e9 + 47;

template<typename T>
void updMax(T& a, T b)
{
	a = max(a, b);
}

int getBit(int mask, int i)
{
	return (mask >> i) & 1;
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int h, t;
	cin >> h >> t;
	VI c(h);
	int maxC = 0;
	for (int& ci : c)
	{
		cin >> ci;
		maxC = max(maxC, ci);
	}
	if (maxC > t || maxC == 0)
	{
		cout << "0\n";
		return 0;
	}
	vector<PII> a(t);
	for(auto& [d, income] : a)
		cin >> d >> income;
	VI vec;
	FOR(j, 1, maxC + 1)
	{
		int cur = 0;
		for (int ci : c)
		{
			if (j <= ci)
				cur++;
			else
			{
				if (cur != 0)
					vec.PB(cur);
				cur = 0;
			}
		}
		if (cur != 0)
			vec.PB(cur);
	}
	assert(!vec.empty());
	FOR(i, 1, SZ(vec))
		vec[i] += vec[i - 1];
	VI dp(1 << t, -INF);
	dp[0] = 0;
	int ans = 0;
	FOR(mask, 0, 1 << t)
	{
		if (dp[mask] < 0)
			continue;
		int sumMask = 0;
		FOR(i, 0, t)
			if (getBit(mask, i))
				sumMask += a[i].F;
		if (sumMask >= vec.back())
		{
			if (sumMask == vec.back())
				updMax(ans, dp[mask]);
			continue;
		}
		int ub = *upper_bound(ALL(vec), sumMask);
		FOR(i, 0, t)
		{
			if (!getBit(mask, i) && sumMask + a[i].F <= ub)
			{
				updMax(dp[mask | (1 << i)], dp[mask] + a[i].S);
			}
		}
	}
	cout << ans << "\n";
	return 0;
}