import sys

input = sys.stdin.readline


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

PC = [0] * (1 << n)
for i in range(1, 1 << n):
    p = i & -i
    PC[i] = PC[i ^ p] + 1

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):
    dbit = 1 << i
    for s in range(0, 1 << n, 2 * dbit):
        for j in range(s, s + dbit):
            dp[j] += dp[dbit | j]

for bit, p in enumerate(PC):
    dp[bit] *= C[p]

for i in range(n):
    dbit = 1 << i
    for s in range(0, 1 << n, 2 * dbit):
        for j in range(s, s + dbit):
            dp[dbit | j] += dp[j]


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

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

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