#pragma GCC optimize("Ofast,urnoll-loops")

#include <bits/stdc++.h>


using namespace std;


#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()


const ll inf = 1e18;
mt19937 rnd(234);


int n, k;
vector<int> p;
vector<vector<ll>> c;
vector<ll> a;
vector<ll> f;
vector<ll> cnt;


ll solve() {
    vector<int> prm(n);
    for (int i = 0; i < n; i += 1) {
        prm[i] = i;
    }
    ll rs = inf;
    for (int itr = 0; itr < 10000; itr += 1) {
        shuffle(all(prm), rnd);
        cnt.assign(k, 0);
        ll sm = 0;
        for (auto i : prm) {
            ll opt = -1;
            for (int j = 0; j < k; j += 1) {
                if (cnt[j] == a[j]) {
                    continue;
                }
                if (opt == -1 || c[i][j] < c[i][opt]) {
                    opt = j;
                }
            }
            assert(opt != -1);
            cnt[opt] += 1;
            sm += c[i][opt];
        }
        rs = min(rs, sm);
    }
    return rs;
}

int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    cin >> n >> k;
    c.assign(n, vector<ll>(k));
    for (int i = 0; i < n; i += 1) {
        for (int j = 0; j < k; j += 1) {
            cin >> c[i][j];
        }
    }
    a.resize(k);
    for (int i = 0; i < k; i += 1) {
        cin >> a[i];
    }
    ll rs = solve();
    cout << rs << "\n";
    return 0;
}