#include <bits/stdc++.h>
using namespace std;

#define int long long
#define mod 1000000007
#define pb push_back
#define ss second
#define ff first
#define all(v) v.begin(), v.end()
#define deb(...) __logger(#__VA_ARGS__, __VA_ARGS__)
template <typename... Args> 
void __logger(string vars, Args &&...values) {
    cerr << "\n" << vars << " = ";
    string delim = "";
    (..., (cerr << delim << values, delim = ", "));
    cerr << "\n";
}
#define w(x) \
    int x;     \
    cin >> x;  \
    while (x--)

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// uniform_int_distribution<int>(low,high)(rng) or rng() % LIMIT

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);  
    
    int n,m,p;
    cin >> n >> m >> p;
    string s[n];
    for(int i = 0; i < n; ++i)
    	cin >> s[i];

    string ans(m,'0');
    int ansCount = 0;

    for(int TT = 0; TT < 30; TT++) {
    	string parent = s[rng() % n];
    	vector<int> poss;
    	for(int i = 0; i < m; ++i)
    		if(parent[i] == '1')
    			poss.push_back(i);

    	int a[1 << 15];
    	memset(a,0,sizeof a);

    	// atleast b[i]th bit present in a[j] (for all j)

    	//building a for all people
    	for(int i = 0; i < n; ++i) {
    		int bit = 0;
    		for(int j = 0; j < poss.size(); ++j)
    			if(s[i][poss[j]] == '1')
    				bit ^= (1 << j);

    		a[bit]++;
    	}
    	
    	int b[1 << 15];
    	memset(b,0,sizeof b);


    	//building b with https://cp-algorithms.com/algebra/all-submasks.html
    	for(int i = 0; i < (1 << 15); ++i)
    		for(int j = i; j > 0; j = (j - 1) & i) {
    			b[j] += a[i];
    		}

    	int ansCur = 0,setCnt = 0;

    	for(int i = 0; i < (1 << 15); ++i) {
    		if(b[i] >= n / 2 + n % 2 && __builtin_popcount(i) > setCnt) {
    			setCnt = __builtin_popcount(i);
    			ansCur = i;
    		}	
    	}

    	if(setCnt > ansCount) {
    		ansCount = setCnt;
    		ans = string(m,'0');
    		int j = 0;

    		for(int i = 0; i < poss.size(); ++i) {
    			if(ansCur & (1 << i))
    				ans[poss[i]] = '1';
    		}

    	}
	}

	// deb(ans,ansCount);
	cout << ans;
    return 0;
}