def popcount32(x):
    x = x - ((x >> 1) & 0x55555555)
    x = (x & 0x33333333) + ((x >> 2) & 0x33333333)
    x = (x + (x >> 4)) & 0x0F0F0F0F
    x += x >> 8
    x += x >> 16
    return x & 0x0000003F


n, m, k = map(int, input().split())

nCk = [[0] * (n + 1) for _ in range(n + 1)]
nCk[0][0] = 1
for i in range(1, n + 1):
    nCk[i][0] = 1
    for j in range(1, i + 1):
        nCk[i][j] = nCk[i - 1][j - 1] + nCk[i - 1][j]


dp = [0] * (1 << n)
for _ in range(m):
    S = int(input(), 2)
    dp[S] += 1


C = [0] * (n + 1)
C[k] = 1
for i in range(k + 1, n + 1):
    C[i] = 1
    for j in range(i):
        C[i] -= C[j] * nCk[i][j]


for i in range(n):
    for bit in range(1 << n):
        if bit >> i & 1:
            dp[bit ^ (1 << i)] += dp[bit]

for bit in range(1 << n):
    dp[bit] *= C[popcount32(bit)]

for i in range(n):
    for bit in range(1 << n):
        if bit >> i & 1:
            dp[bit] += dp[bit ^ (1 << i)]

ans = [1 << 30] * m
for bit in range(1 << n):
    c = dp[bit] - 1
    if c >= 0:
        ans[c] = min(ans[c], popcount32(bit))

for i in range(m - 2, -1, -1):
    ans[i] = min(ans[i], ans[i + 1])

print(*ans, sep="\n")