#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
struct pair_hash{
size_t operator()(const pair<int,int>&x)const{
return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
}
};
const int MAXT = 20007;
const int MAXN = 52;
const int INF = 2e9;
int dp[MAXN][MAXT];
string S[MAXN];
int A[MAXT];
int pref[MAXT];
int lst[MAXN];
int f0[MAXT];
int n, t, s;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> t >> s;
for(int i = 1; i <= t; i++){
cin >> A[i];
pref[i] = pref[i - 1] + A[i];
}
for(int i = 1; i <= n; i++){
cin >> S[i];
f0[0]++;
}
for(int j = 1; j <= s; j++){
dp[0][j] = INF;
}
for(int i = 1; i <= t; i++){
dp[i][0] = INF;
set<int> pos;
pos.insert(i - 1);
pos.insert(0);
for(int j = 1; j <= n; j++){
if(S[j][i - 1] == '0'){
f0[lst[j]]--;
lst[j] = i;
f0[i]++;
}
pos.insert(lst[j]);
pos.insert(lst[j] + 1);
pos.insert(lst[j] - 1);
}
vi vec = {};
for(auto ele : pos){
vec.pb(ele);
}
reverse(all(vec));
// for(int j = 1; j <= n; j++){
// cerr << lst[j] << ' ';
// }
// cerr << '\n';
// for(int j = 0; j <= i; j++){
// cerr << f0[j] << ' ';
// }
// cerr << '\n';
int cnt = n;
for(int k = 1; k <= s; k++){
dp[i][k] = INF;
cnt = n;
for(auto x : vec){
if(x < 0){
break;
}
cnt -= f0[x];
if(x - 1 < 0 || dp[x - 1][k - 1] == INF || x - 1 >= i){
continue;
}
//cerr << i << ' ' << k << ' ' << x << ' ' << cnt << '\n';
dp[i][k] = min(dp[i][k], dp[x - 1][k - 1] + (pref[i] - pref[x - 1]) * cnt);
// cerr << dp[i][k] << '\n';
}
}
}
for(int k = 1; k <= s; k++){
cout << dp[t][k] << '\n';
}
return 0;
}
