use std::io::Write;

fn run() {
    input! {
        n: usize,
        m: usize,
        k: usize,
        s: [bytes; m],
    }
    let mut dp = vec![0i32; 1 << n];
    for s in s {
        let mut bit = 0usize;
        for (i, c) in s.iter().enumerate() {
            if *c == b'1' {
                bit |= 1 << i;
            }
        }
        dp[bit] += 1;
    }
    bitwise_transform(&mut dp, |a, b| *a += *b);
    let mut binom = vec![vec![0i32; 2 * n + 1]; 2 * n + 1];
    binom[0][0] = 1;
    for i in 1..binom.len() {
        binom[i][0] = 1;
        for j in 1..(i + 1) {
            binom[i][j] = binom[i - 1][j - 1] + binom[i - 1][j];
        }
    }
    let mut mul = vec![0; n + 1];
    for i in k..=n {
        let mut sum = 0;
        for j in k..i {
            sum += binom[i][j] * mul[j];
        }
        mul[i] = -sum + 1;
    }
    for (i, dp) in dp.iter_mut().enumerate() {
        let c = i.count_ones() as usize;
        *dp *= mul[c];
    }
    bitwise_transform(&mut dp, |a, b| *b += *a);
    let mut ans = vec![n; m + 1];
    for (i, dp) in dp.iter().enumerate() {
        let c = i.count_ones() as usize;
        if c >= k {
            ans[*dp as usize].chmin(c);
        }
    }
    for i in (1..m).rev() {
        ans[i] = ans[i].min(ans[i + 1]);
    }
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    for a in ans[1..].iter() {
        writeln!(out, "{}", *a).ok();
    }
}

fn main() {
    run();
}

// ---------- begin bitwise transform ----------
pub fn bitwise_transform<T, F>(a: &mut [T], mut f: F)
where
    F: FnMut(&mut T, &mut T)
{
    let n = a.len().trailing_zeros() as usize;
    assert!(a.len() == 1 << n);
    for i in 0..n {
        for a in a.chunks_exact_mut(2 << i) {
            let (x, y) = a.split_at_mut(1 << i);
            for (x, y) in x.iter_mut().zip(y) {
                f(x, y);
            }
        }
    }
}
// ---------- end bitwise transform ----------
// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[macro_export]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[macro_export]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------
// ---------- begin chmin, chmax ----------
pub trait ChangeMinMax {
    fn chmin(&mut self, x: Self) -> bool;
    fn chmax(&mut self, x: Self) -> bool;
}

impl<T: PartialOrd> ChangeMinMax for T {
    fn chmin(&mut self, x: Self) -> bool {
        *self > x && {
            *self = x;
            true
        }
    }
    fn chmax(&mut self, x: Self) -> bool {
        *self < x && {
            *self = x;
            true
        }
    }
}
// ---------- end chmin, chmax ----------