#include<bits/stdc++.h>
#define int long long
using namespace std;
#define dbg(x...) \
do { \
    cout << #x << " -> "; \
    err(x); \
} while (0)

void err() {
    cout<<endl<<endl;
}
 
template<class T, class... Ts>
void err(T arg, Ts ... args) {
    cout<<fixed<<setprecision(10)<<arg<< ' ';
    err(args...);
}
constexpr int  Max = 1e18;
void solve(){
    int n, k; cin >> n >> k;
    vector a(n + 1, vector<int> (k + 1));
    for(int i = 1; i <= n; i++){
    	for(int j = 1; j <= k; j++){
    		cin >> a[i][j];
    	}
    }
    vector<int> lim(k + 1);
    vector<int> bl(n + 1);
    for(int i = 1; i <= k; i++) cin >> lim[i];
    int ans = 0;
    vector q(k + 1, vector (k + 1, set<pair<int ,int>>()));
    auto add = [&](int x) -> void{
        for(int i = 1; i <= k; i++){
            if(i == bl[x])continue;
            q[bl[x]][i].insert({a[x][i] - a[x][bl[x]], x});
        }
    };
    auto del = [&](int x) -> void{
        for(int i = 1; i <= k; i++){
            if(i == bl[x])continue;
            q[bl[x]][i].erase({a[x][i] - a[x][bl[x]], x});
        }
    };
    for(int i = 1; i <= n; i++){
        add(i);
    }
    for(int tot = 1; tot <= n; tot++){
        vector g(k + 2, vector<int>(k + 2));
        for(int i = 0; i <= k; i++){
            for(int j = 1; j <= k; j++){
                if(q[i][j].empty())g[i][j] = Max;
                else g[i][j] = q[i][j].begin() -> first;
            }
        }
        vector<int> dis(k + 2, Max), pre(k + 1, -1);
        vector<int> vis(k + 2, 0);
        queue<int> que;
        dis[0] = 0;
        que.push(0);
        while(!que.empty()){
            int u = que.front();
            que.pop();
            vis[u] = 1;
            for(int i = 1; i <= k; i++){
                if(dis[u] + g[u][i] < dis[i]){
                    dis[i] = dis[u] + g[u][i];
                    pre[i] = u;
                    if(!vis[i]){
                        vis[i] = 1;
                        que.push(i);
                    }

                }
            }
        }
        int now = -1;
        for(int i = 1; i <= k; i++){
            if(lim[i] && (now == -1 || dis[i] < dis[now])){
                now = i;
            }
        }
        ans += dis[now];
        lim[now]--;
        while(now){
            int fa = pre[now];
            int v = q[fa][now].begin() -> second;
            del(v);
            bl[v] = now;
            add(v);
            now = pre[now];
        }
    }
    // for(int i = 1; i <= n; i++){
    // 	dbg(i, bl[i]);
    // }
    cout << ans << '\n';
    return ;
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t=1;//cin>>t;
    while(t--)solve();
    return 0;
}