#include<iostream>
#include<cmath>
#include<cstring>
#include<cassert>
#include<string>
#include<queue>
#include<deque>
#include<stack>
#include<algorithm>
#include<unordered_map>
#include<map>
#include<vector>
#include<set>
#include<unordered_set>
#include<bitset>
#include<climits>
#include<numeric>
#include<functional>
#include<iomanip>
#ifdef YJL
#include<debug.h>
#else
#define debug(args...)0
#define debug_n(a,n)0
#endif
#define ALL(a) a.begin(),a.end()
using namespace std;
using ll=long long;

using PQ = priority_queue<pair<int,int>,vector<pair<int,int>>, greater<>>;
PQ pq[11][10];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n,k;
    cin>>n>>k;

    constexpr int inf = 0x3f3f3f3f;
    vector c(n,vector<int>(k+1));
    for(int i=0; i<n; ++i) {
        for(int j=0; j<k; ++j) {
            cin>>c[i][j];
        }
        c[i][k] = inf;
    }
    
    vector<int> a(k+1);
    for(int i=0; i<k; ++i) {
        cin>>a[i];
    }

    ll ans = 1ll*inf*n;
    vector<int> place(n, k);
    for(int i=0; i<n; ++i) {
        for(int j=0; j<k; ++j) {
            pq[j][k].emplace(c[i][j] - c[i][k], i);
        }
    }
    
    vector<int> vis(k+1);
    for(int turn=0; turn<n; ++turn) {
        // find shortest path
        vector<ll> dis(k+1, 1e18);
        vector<int> pre(k+1, -1);
        queue<int> q;
        for(int i=0; i<k; ++i) {
            if(a[i]) {
                q.push(i), dis[i] = 0, vis[i] = true;
            }
        }
        while(q.size()) {
            int u = q.front(); q.pop();
            vis[u] = false;
            for(int v=0; v<=k; ++v) {
                if(v==u) continue;
                while(pq[u][v].size() and place[pq[u][v].top().second] != v)
                    pq[u][v].pop();
                if(pq[u][v].empty())
                    continue;
                if(dis[v] > dis[u]+pq[u][v].top().first) {
                    dis[v] = dis[u]+pq[u][v].top().first;
                    pre[v] = u;
                    if(!vis[v]) {
                        q.push(v), vis[v] = true;
                    }
                }
            }
        }

        ans += dis[k];
        for(int j=k; pre[j]!=-1; j=pre[j]) {
            int p = pre[j];
            int u = pq[p][j].top().second;
            place[u] = p;
            a[j]++;
            a[p]--;
            for(int i=0; i<k; ++i)
                if(i!=p)
                    pq[i][p].emplace(c[u][i] - c[u][p], u);
        }
    }
    cout << ans;
    return 0;
}
/*




*/