#include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l), i##end = (r);i <= i##end;++i)
using std::cin;
using std::cout;

const int N = 5056;

using u64 = unsigned long long;
using u32 = unsigned;

int start;
struct vector {
	static const int M = N / 64;
	u64 a[M + 1];
	bool test(int x) {
		return a[x >> 6] >> (x & 63) & 1;
	}
	u32 substr(int x) {
		return *(u64*)((u32*) a + (x >> 5)) >> (x & 31);
	}
	void set(int x) {
		a[x >> 6] |= 1ull << x;
	}
	void solve_xor(const vector & x, int lim = M - 1) {
		for(int i = start;i < M;++i) {
			a[i] ^= x.a[i];
		}
	}
	int get(const vector & x) {
		u64 ans = 0;
		for(int i = 0;i < M;++i) {
			ans ^= a[i] & x.a[i];
		}
		return std::popcount(ans) % 2;
	}
};
int n, m;
vector a[N], ans;
u32 reverse_bits(u32 x) {
	x = (((x & 0xaaaaaaaa) >> 1) | ((x & 0x55555555) << 1));
	x = (((x & 0xcccccccc) >> 2) | ((x & 0x33333333) << 2));
	x = (((x & 0xf0f0f0f0) >> 4) | ((x & 0x0f0f0f0f) << 4));
	x = (((x & 0xff00ff00) >> 8) | ((x & 0x00ff00ff) << 8));
	return ((x >> 16) | (x << 16));
}
using pr = std::pair<u32, int>;
pr v[N];
int idx[N];

int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> n >> m;
	for(int x = 0;x < m;++x) {
		char c;
		for(int i = 0;i <= n;++i) {
			cin >> c;
			if(c & 1) a[x].set(i);
		}
	}
	int r = 0;
	for(int i = 0;i < n;++i) {
		int c = 0;
		for(int j = r;j < m;++j) {
			if(a[j].test(i)) {
				v[c++] = pr(reverse_bits(a[j].substr(i)), j);
			}
		}
		if(c != 0) {
			sort(v, v + c);
			for(int j = 0;j + 1 < c;++j) {
				a[v[j].second].solve_xor(a[v[j + 1].second]);
			}
			std::swap(a[v[c - 1].second], a[r]);
			idx[r] = i;
			r += 1;
		}
	}
	ans.set(n);
	for(int i = r - 1;i >= 0;--i) {
		if(ans.get(a[i])) {
			ans.set(idx[i]);
		}
	}
	for(int i = 0;i < n;++i) {
		cout << ans.test(i) << ' ';
	}
}