#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

ll d1[1 << 24];
// ll d2[1 << 24];

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  rep(_, m) {
    string s;
    cin >> s;
    int x = 0;
    rep(i, n) x |= (s[i] - '0') << i;
    d1[x]++;
  }
  rep(i, n) rep(s, 1 << n) if (s >> i & 1) d1[s ^ (1 << i)] += d1[s];
  // rep(s, 1 << n) cout << d1[s] << ' ';
  // cout << endl;
  rep(s, 1 << n) {
    int pc = popcount(1U * s);
    if (pc > k) {
      d1[s] = -(pc - 1) * d1[s];
    }
    if (pc < k) d1[s] = 0;
  }
  // rep(s, 1 << n) cout << d1[s] << ' ';
  // cout << endl;
  rep(i, n) rep(s, 1 << n) if (s >> i & 1) d1[s] += d1[s ^ (1 << i)];
  // rep(s, 1 << n) cout << d1[s] << ' ';
  // cout << endl;
  VI ans(m + 1, m);
  rep(s, 1 << n) {
    int pc = popcount(1U * s);
    if (pc >= k) chmin(ans[d1[s]], pc);
  }
  rrep(i, m) chmin(ans[i], ans[i+1]);
  for (int i = 1; i <= m; i++) {
    cout << ans[i] << '\n';
  }
}