#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <string>
#include <algorithm>
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <functional>
#include <iostream>
#define INF 1000000
using namespace std;
typedef long long ll;
typedef pair<int,int> P;

class edge{
public:
	int to,cap,cost,rev;
	edge(){}
	edge(int tt,int cc,int co,int rr){
		to=tt;
		cap=cc;
		cost=co;
		rev=rr;
	}
};

int V;
vector<edge> G[1000];
int dist[1000];
int h[1000];
int prevv[1000],preve[1000];

void add_edge(int from,int to,int cap,int cost){
	G[from].push_back(edge(to,cap,cost,G[to].size()));
	G[to].push_back(edge(from,0,-cost,G[from].size()-1));
}

int min_cost_flow(int s,int t,int f){
	int res=0;
	fill(h,h+V,0);
	while(f>0){
		priority_queue<P,vector<P>,greater<P> > que;
		fill(dist,dist+V,INF);
		dist[s]=0;
		que.push(P(0,s));
		while(que.size()){
			P p=que.top();
			que.pop();
			int v=p.second;
			if(dist[v]<p.first)continue;
			for(int i=0;i<G[v].size();i++){
				edge &e=G[v][i];
				if(e.cap>0 && dist[e.to]>dist[v]+e.cost+h[v]-h[e.to]){
					dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];
					prevv[e.to]=v;
					preve[e.to]=i;
					que.push(P(dist[e.to],e.to));
				}
			}
		}
		if(dist[t]==INF){
			return -1;
		}
		for(int v=0;v<V;v++){
			h[v]+=dist[v];
		}
		int d=f;
		for(int v=t;v!=s;v=prevv[v]){
			d=min(d,G[prevv[v]][preve[v]].cap);
		}
		f-=d;
		res+=d*h[t];
		for(int v=t;v!=s;v=prevv[v]){
			edge &e=G[prevv[v]][preve[v]];
			e.cap-=d;
			G[v][e.rev].cap+=d;
		}
	}
	return res;
}

int n,m,k;
int a[101];
int b[101][101];
int T[101];

int main(void){
	scanf("%d%d%d",&n,&m,&k);
	for(int i=0;i<n;i++){
		scanf("%d",&a[i]);
	}
	for(int i=0;i<m;i++){
		for(int j=0;j<n;j++){
			scanf("%d",&b[i][j]);
		}
	}
	for(int i=0;i<m;i++){
		scanf("%d",&T[i]);
	}
	int s=n+m+1,t=s+1;
	V=t+1;
	for(int i=0;i<n;i++){
		add_edge(s,i,1,0);
		add_edge(i,t,1,100-a[i]);
		for(int j=0;j<m;j++){
			add_edge(i,n+j,1,100-b[j][i]);
		}
	}
	for(int i=0;i<m;i++){
		add_edge(n+i,n+m,T[i],0);
	}
	if(m>0)add_edge(n+m,t,n-k,0);
	printf("%d\n",n*100-min_cost_flow(s,t,n));
	return 0;
}