#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using ll   = long long;
using ull  = unsigned long long;
using ld   = long double;
using pii  = pair<int,int>;
using pll  = pair<ll,ll>;
using vi   = vector<int>;
using vb   = vector<bool>;
using vc   = vector<char>;
using vvc  = vector<vc>;
using vvi  = vector<vi>;
using vvb  = vector<vb>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vll  = vector<ll>;
using vull = vector<ull>;
using vvll = vector<vll>;
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define f first
#define s second
#define pb emplace_back
#define rep(i, begin, end) for(auto i = (begin); i <= (end); ++i)
#define repr(i, begin, end) for(auto i = (begin); i >= (end); --i)
#define bend(X) X.begin(), X.end()
#ifdef LOCAL
#define deb(...) cout << #__VA_ARGS__ << " = " << __VA_ARGS__ << endl
#define say(...) cout << __VA_ARGS__ << endl
#else
#define deb(x)
#define say(x)
#define endl '\n'
#endif
constexpr int INF = 1e9+1e7;
constexpr ll INFl = INF;
constexpr ll INFll = 1e18+1e16;
void print() { cout << '\n'; }
template <typename T, typename... Args> void print(T x, Args... args) { cout << x << ' '; print(args...); }
template <typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1,T2> x) { os << x.f << ' ' << x.s; return os; }
template <typename T1, typename T2> istream& operator>>(istream& is, pair<T1,T2>& x) { is >> x.f >> x.s; return is; }
template <typename Ch, typename Tr, typename T> ostream& operator<<(basic_ostream<Ch,Tr>& os, T x) { for(auto i : x) os << i << ' '; return os; }
template <typename T> istream& operator>>(istream& is, vector<T>& x) { for(T& i : x) is >> i; return is; }
template <typename T1, typename T2> pair<T1,T2> operator+(const pair<T1,T2>& A, const pair<T1,T2>& B) { return {A.f+B.f, A.s+B.s}; }
template <typename T1, typename T2> pair<T1,T2> operator-(const pair<T1,T2>& A, const pair<T1,T2>& B) { return {A.f-B.f, A.s-B.s}; }
template <typename T1, typename T2> pair<T1,T2>& operator+=(pair<T1,T2>& A, const pair<T1,T2>& B) { A.f += B.f; A.s += B.s; return A; }
template <typename T1, typename T2> pair<T1,T2>& operator-=(pair<T1,T2>& A, const pair<T1,T2>& B) { A.f -= B.f; A.s -= B.s; return A; }
template <typename T1, typename T2> pair<T1,T2> operator-(const pair<T1,T2>& A) { return {-A.f, -A.s}; }
template <typename T1, typename T2> bool maxe(T1& A, const T2& B) { if(B>A) { A=B; return 1; } return 0; }
template <typename T1, typename T2> bool mine(T1& A, const T2& B) { if(B<A) { A=B; return 1; } return 0; }
class Nic{} nic;
template <typename T> Nic operator<<(Nic, T) { return nic; }
Nic operator<<(ostream&, Nic) { return nic; }

//////////////////////////////////////////////////

constexpr int maxN = 16;
int n;
int W[maxN+1], sumW[1<<maxN], sumV[1<<maxN];
pii T[maxN], sum[1<<maxN];
bool DP[maxN+1][1<<maxN];

void ala() {
    int dni;
    cin >> dni >> n;
    vector<int> plecaki;
    vector<int> aktualna_pojemnosc(n, 0);
    for (int i = 0; i < dni; i++) {
        int iledzis;
        cin >> iledzis;
        for (int j = 0; j < n; j++) {
            if (iledzis > j) {
                aktualna_pojemnosc[j] += 1;
            } else {
                if (aktualna_pojemnosc[j] > 0) {
                    plecaki.push_back(aktualna_pojemnosc[j]);
                }
                aktualna_pojemnosc[j] = 0;
            }
        }
    }

    for (auto akt : aktualna_pojemnosc) {
        if (akt > 0) {
            plecaki.push_back(akt);
        }
    }
    sort(plecaki.begin(), plecaki.end(), greater<int>());
    vector<int> najplecaki;
    for (int i = 0; i < min(n, (int)plecaki.size()); i++)
        W[i] = plecaki[i];
}

auto solve() {
    ala();
    rep (i, 0, n-1)
        cin >> T[i];
    for (int b = 0; b < (1<<n); b++) {
        rep (i, 0, n-1)
            if ((1<<i)&b) {
                sum[b] += T[i];
            }
    }
    

    DP[0][0] = true;
    rep (i, 1, n)
        for (int b = 0; b < (1<<n); b++) {
            DP[i][b] = DP[i-1][b];
            for (int c = b; c && !DP[i][b]; c = (c-1)&b)
                if (DP[i-1][b-c] && sum[c].f <= W[i-1])
                    DP[i][b] = true;
        }
    int R = 0;
    for (int b = 0; b < (1<<n); b++)
        if (DP[n][b])
            maxe(R, sum[b].s);

    return R;
}



int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int noOfTests = 1;
    //cin >> noOfTests;

    while(noOfTests --> 0)
        cout << solve() << '\n';

    return 0;
}