import sys
from time import perf_counter

start = perf_counter()

N_MAX = 24

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

popcnt = [0] * (1 << N_MAX)
for t in range(1, 1 << N_MAX):
    popcnt[t] = 1 + popcnt[t & (t - 1)]

f = [0] * (1 << N_MAX)

print(perf_counter() - start, file=sys.stderr)

readline = sys.stdin.readline

n, m, k = map(int, readline().split())
for i in range(m):
    # reversed, but it's ok
    s = int(readline(), 2)
    f[s] += 1

a = [0] * (n + 1)
for l in range(k, n + 1):
    a[l] = (-1) ** (l - k) * binom[l - 1][l - k]

print(perf_counter() - start, file=sys.stderr)

# supset zeta
b = 1
while b < 1 << n:
    for l in range(0, 1 << n, 2 * b):
        for p in range(l, l + b):
            f[p] += f[p + b]
    b *= 2

print(perf_counter() - start, file=sys.stderr)

for t in range(1 << n):
    f[t] *= a[popcnt[t]]

print(perf_counter() - start, file=sys.stderr)

# subset zeta
b = 1
while b < 1 << n:
    for l in range(0, 1 << n, 2 * b):
        for p in range(l, l + b):
            f[p + b] += f[p]
    b *= 2

print(perf_counter() - start, file=sys.stderr)

g = [n + 1] * (m + 1)
for t in range(1 << n):
    g[f[t]] = min(g[f[t]], popcnt[t])

for p in reversed(range(m)):
    g[p] = min(g[p], g[p + 1])

print(perf_counter() - start, file=sys.stderr)

print('\n'.join(map(str, g[1:])))

print(perf_counter() - start, file=sys.stderr)