#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int N, M, K;
char S[300'010][25];

Int bn[25][25], pie[25];

int main() {
  for (; ~scanf("%d%d%d", &N, &M, &K); ) {
    for (int i = 0; i < M; ++i) {
      scanf("%s", S[i]);
    }
    
    for (int n = 0; n <= N; ++n) {
      bn[n][0] = bn[n][n] = 1;
      for (int k = 1; k < n; ++k) {
        bn[n][k] = bn[n - 1][k - 1] + bn[n - 1][k];
      }
    }
    for (int n = 0; n <= N; ++n) {
      pie[n] = (n >= K) ? 1 : 0;
      for (int k = 0; k < n; ++k) {
        pie[n] -= bn[n][k] * pie[k];
      }
    }
cerr<<"pie = ";pv(pie,pie+(N+1));
    
    vector<Int> fs(1 << N, 0);
    for (int i = 0; i < M; ++i) {
      int p = 0;
      for (int e = 0; e < N; ++e) p |= (S[i][e] - '0') << e;
      ++fs[p];
    }
    for (int e = 0; e < N; ++e) {
      for (int p = 0; p < 1 << N; ++p) if (!(p & 1 << e)) {
        fs[p] += fs[p | 1 << e];
      }
    }
    for (int p = 0; p < 1 << N; ++p) {
      fs[p] *= pie[__builtin_popcount(p)];
    }
    for (int e = 0; e < N; ++e) {
      for (int p = 0; p < 1 << N; ++p) if (!(p & 1 << e)) {
        fs[p | 1 << e] += fs[p];
      }
    }
    vector<Int> mxs(N + 1, 0);
    for (int p = 0; p < 1 << N; ++p) {
      chmax(mxs[__builtin_popcount(p)], fs[p]);
    }
cerr<<"mxs = "<<mxs<<endl;
    
    for (int m = 1; m <= M; ++m) {
      const int ans = lower_bound(mxs.begin(), mxs.end(), m) - mxs.begin();
      printf("%d\n", ans);
    }
  }
  return 0;
}