#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int T = 4001;
const int N = 51;
const int S = 51;
const int INF = 2e9 + 10;
int n, t, s, p[T], dp[S][T], sumP[T], sumA[N][T], cost[T][T];
string a[N];
void ReadInput(){
cin >> n >> t >> s;
for(int i = 1; i <= t; i++)
cin >> p[i];
for(int i = 1; i <= n; i++){
cin >> a[i];
a[i] = '*' + a[i];
}
}
int Cost(int l, int r){
int sum = sumP[r] - sumP[l - 1], cnt = 0;
for(int i = 1; i <= n; i++)
cnt += (sumA[i][r] - sumA[i][l - 1] == r - l + 1);
return sum * cnt;
}
void Solve(){
for(int i = 1; i <= t; i++)
sumP[i] = sumP[i - 1] + p[i];
for(int i = 1; i <= n; i++)
for(int j = 1; j <= t; j++)
sumA[i][j] = sumA[i][j - 1] + (a[i][j] == '1');
for(int i = 1; i <= t; i++)
for(int j = i; j <= t; j++)
cost[i][j] = Cost(i, j);
for(int i = 1; i <= t; i++)
dp[1][i] = Cost(1, i);
for(int i = 2; i <= s; i++)
for(int j = i; j <= t; j++){
dp[i][j] = INF;
for(int k = i; k <= j; k++)
dp[i][j] = min(dp[i][j], dp[i - 1][k - 1] + cost[k][j]);
}
for(int i = 1; i <= s; i++)
cout << dp[i][t] << '\n';
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
ReadInput();
Solve();
return 0;
}
