#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001
long long comb[22][22];
int dp[1<<24];
int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	comb[0][0] = 1;
	for(int i=1;i<=20;i++){
		for(int j=0;j<=i;j++){
			if(j!=0)comb[i][j] += comb[i-1][j-1];
			comb[i][j] += comb[i-1][j];
		}
	}
	
	int n,m,k;
	cin>>n>>m>>k;
	vector<long long> kei(n+1);
	kei[k] = 1;
	for(int i=k+1;i<=n;i++){
		for(int j=k;j<i;j++){
			kei[i] += comb[i][j] * kei[j];
		}
		kei[i] = 1-kei[i];
	}
	
	rep(i,m){
		string s;
		cin>>s;
		int ii = 0;
		rep(j,n){
			if(s[j]=='1')ii |= 1<<j;
		}
		dp[ii]++;
	}
	rep(i,n){
		rep(j,1<<n){
			if((j>>i)&1){
				
			}
			else{
				dp[j] += dp[j^(1<<i)];
			}
			
		}
	}
	rep(i,1<<n)dp[i] *= kei[__builtin_popcount(i)];

	rep(i,n){
		rep(j,1<<n){
			if((j>>i)&1){
				
			}
			else{
				dp[j^(1<<i)] += dp[j];
			}
			
		}
	}
	
	
	vector<int> ans(m+1,Inf32);
	rep(i,1<<n){
		//if(dp[i]<0)cout<<i<<' '<<dp[i]<<endl;
		int t = __builtin_popcount(i);
		ans[dp[i]] = min(ans[dp[i]],t);
	}
	for(int i=m;i>=1;i--)ans[i-1] = min(ans[i-1],ans[i]);
	rep(i,m){
		cout<<ans[i+1]<<endl;
	}
	
	
	return 0;
}