1 #include <cstdio>
 2 #include <algorithm>
 3 #include <cstring>
 4 #include <queue>
 5 #define inc(i,j,k) for(int i=j;i<=k;i++)
 6 #define visit(i,j) for(int i=g[j];i!=-1;i=es[i].n)
 7 #define INF 0x3fffffff
 8 using namespace std;
 9
10 struct e{int f,t,c,w,n;}; e es[1000000]; int ess,g[400];
11 void pe(int f,int t,int c,int w){
12     es[++ess]=(e){f,t,c,w,g[f]}; g[f]=ess; es[++ess]=(e){t,f,0,-w,g[t]}; g[t]=ess;
13 }
14 void init(){ess=-1; memset(g,-1,sizeof(g));}
15 int d[400],fr[400]; queue <int> q; bool inq[400],vis[400];
16 bool spfa(int s,int t){
17     while(! q.empty())q.pop(); memset(inq,0,sizeof(inq)); memset(vis,0,sizeof(vis));
18     inq[s]=1; d[s]=0; vis[s]=1; q.push(s);
19     while(! q.empty()){
20         int x=q.front(); q.pop(); inq[x]=0;
21         visit(i,x)if(es[i].c&&(! vis[es[i].t]||d[es[i].t]>d[x]+es[i].w)){
22             d[es[i].t]=d[x]+es[i].w; vis[es[i].t]=1; fr[es[i].t]=i;
23             if(! inq[es[i].t])inq[es[i].t]=1,q.push(es[i].t);
24         }
25     }
26     if(! vis[t])return 0;else return 1;
27 }
28 int advanced(int s,int t){
29     int a=INF; for(int i=t;i!=s;i=es[fr[i]].f)a=min(a,es[fr[i]].c);
30     int cost=0; for(int i=t;i!=s;i=es[fr[i]].f)es[fr[i]].c-=a,es[fr[i]^1].c+=a,cost+=(es[fr[i]].w*a);
31     return cost;
32 }
33 int maxflowmincost(int s,int t){
34     int cost=0; while(spfa(s,t))
35     cost+=advanced(s,t); return cost;
36 }
37 int n,m,k,s,t,a1[400]; char a3[400];
38 int main(){
39     //freopen("test.txt","r",stdin);
40     scanf("%d%d%d",&n,&m,&k); s=0; t=n+m+1; init(); inc(i,1,n)pe(s,i,k,0),pe(i,t,k-1,0);
41     inc(i,n+1,n+m){int a2; scanf("%d",&a2); inc(j,1,n)pe(i,t,1,(j*2-1)*a2);}
42     inc(i,1,m)scanf("%d",&a1[i]); inc(i,1,n){
43         scanf("%s",a3); inc(j,1,m){if(a3[j-1]=='1')pe(i,n+j,1,-a1[j]);}
44     }
45     printf("%d",maxflowmincost(s,t));
46     return 0;
47 }