#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <queue>
#include <bitset>
#include <numeric>
#include <array>
#include <cstring>
#include <random>
#include <chrono>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template<class T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e5 + 42, K = 15, M = (1 << K) + 42;
ll n, m, k;
ll ans = 0;
ll anspop = 0;
ll a[N];
ll b[M];
int main() {

  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

  cin >> n >> m >> k;

  for(ll i = 0; i < n; i++) {
    string s; cin >> s;
    for(ll j = 0; j < m; j++)
      if(s[j] == '1')
        a[i] ^= (1ll << j);
  }

  shuffle(a, a + n, rng);

  for(ll it = 0; it < min(n, 100ll); it++) {
    vector<ll> pos;
    for(ll i = 0; i < m; i++)
      if(((a[it] >> i) & 1ll) == 1ll)
        pos.pb(i);
    k = pos.size();
    for(ll i = 0; i < (1 << k); i++) b[i] = 0;
    for(ll i = 0; i < n; i++) {
      ll cmask = 0;
      for(ll j = 0; j < k; j++)
        if(((a[i] >> pos[j]) & 1ll))
          cmask ^= (1ll << j);
      b[cmask]++;
    }
    for(ll i = 0; i < k; i++)
      for(ll cmask = 0; cmask < (1ll << k); cmask++) {
        if((cmask >> i) & 1ll) continue;
        b[cmask] += b[cmask ^ (1ll << i)];
      }
    for(ll cmask = 0; cmask < (1ll << k); cmask++) {
      if(b[cmask] < (n + 1) / 2) continue;
      ll curpop = __builtin_popcountll(cmask);
      if(curpop > anspop) {
        anspop = curpop;
        ans = 0;
        for(ll i = 0; i < k; i++)
          if((cmask >> i) & 1ll)
            ans ^= (1ll << pos[i]);
      }
    }
  }

  for(ll i = 0; i < m; i++) cout << ((ans >> i) & 1ll);

  return 0;
}
/*

*/
