#include <stdio.h>

const int bit[25] = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576, 2097152, 4194304, 8388608, 16777216};
int comb[25][25];

void chmin(int *a, int b)
{
	if (*a > b) *a = b;
}

int main()
{
	int i, n, m, k;
	char S[300001][25];
	scanf("%d %d %d", &n, &m, &k);
	for (i = 1; i <= m; i++) scanf("%s", S[i]);
	
	char l[16777216];
	int j, x, num[16777216] = {};
	for (i = 1, comb[0][0] = 1; i <= n; i++) for (j = 1, comb[i][0] = 1, comb[i][i] = 1; j < i; j++) comb[i][j] = comb[i-1][j-1] + comb[i-1][j];
	for (x = 1, j = 1, l[0] = 0; x < bit[n]; x++, j++) {
		for (i = 0; (x & bit[i]) == 0; i++) j--;
		l[x] = j;
	}
	for (i = 1; i <= m; i++) {
		for (j = 0, x = 0; j < n; j++) if (S[i][j] != '0') x |= bit[j];
		num[x]++;
	}
	for (i = 0; i < n; i++) {
		for (x = 0; x < bit[n]; x++) {
			if ((x & bit[i]) == 0) continue;
			num[x ^ bit[i]] += num[x];
		}
	}
	// for (x = 0; x < bit[n]; x++) printf("%d %d\n", x, num[x]);

	int sum[16777216] = {};
	for (x = 0; x < bit[n]; x++) {
		if (l[x] >= k) {
			if ((l[x] - k) % 2 == 0) sum[x] = num[x] * comb[l[x]-1][k-1];
			else sum[x] = -num[x] * comb[l[x]-1][k-1];
		}
	}
	for (i = 0; i < n; i++) {
		for (x = 0; x < bit[n]; x++) {
			if ((x & bit[i]) != 0) continue;
			sum[x ^ bit[i]] += sum[x];
		}
	}
	// for (x = 0; x < bit[n]; x++) printf("%d %d\n", x, sum[x]);
	
	int ans[300001];
	for (i = 1; i <= m; i++) ans[i] = n;
	for (x = 0; x < bit[n]; x++) chmin(&(ans[sum[x]]), l[x]);
	for (i = m - 1; i >= 1; i--) chmin(&(ans[i]), ans[i+1]);
	for (i = 1; i <= m; i++) printf("%d\n", ans[i]);
	fflush(stdout);
	return 0;
}