#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#include <iostream>

using namespace std;
#define int long long
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()

const int inf = 1e9;
const int mxt = 2e4+5;
const int mxn = 51;

int n,t,s;
int pt[mxt];
vector<int> wa[mxn];
int np[mxn];
int dp[mxt][mxn];

int range_sum(int l, int r) {
	assert(l <= r);
	return pt[r] - (l ? pt[l-1] : 0);
}

void solve(int nt) {
	for (int i = 0; i < mxt; i++) {
		for (int j = 0; j < mxn; j++) {
			dp[i][j] = inf;
		}
	}
	memset(np, 0, sizeof(np));
	dp[0][0] = 0;
	vector<int> wat;
	for (int i = 0; i <= t; i++) {
		for (int j = 0; j <= nt; j++) {
			if (dp[i][j] == inf) continue;
//			cout << "\n" << i << " " << j << " - " << dp[i][j] << ":\n";
			wat.resize(0);
			wat.push_back(t);
			for (int k = 0; k < n; k++) {
				if (np[k] < sz(wa[k])) wat.push_back(wa[k][np[k]]);
			}
			sort(all(wat));
			for (int k = 0; k < sz(wat); k++) {
				int tt = wat[k];
//				cout << tt << " ";
				if (tt == i) continue;
				dp[tt][j + 1] = min(dp[tt][j + 1], dp[i][j] + range_sum(i, tt - 1) * (n - k));
			}
//			cout << "\n";
		}
		for (int j = 0; j < n; j++) {
			if (wa[j][np[j]] == i) {
				np[j]++;
			}
		}
	}
	cout << dp[t][nt] << "\n";
}

signed main() {
	cin >> n >> t >> s;
	for (int i = 0; i < t; i++) {
		cin >> pt[i];
		if (i) {
			pt[i] += pt[i - 1];
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < t; j++) {
			char c;
			cin >> c;
			if (c == '0') {
				wa[i].push_back(j);
			}
		}
//		wa[i].push_back(t);
	}
	for (int i = 1; i <= s; i++) {
		solve(i);
	}
	return 0;
}