#include <bits/stdc++.h>

using namespace std;

const int N = 5505;

int n, m, b[N], c[N];
bitset<N> a[N];

void gauss() {
	int t = 1;
	for (int i = 1; i <= n && t <= m; ++i) {
		if (!a[t][i]) {
			for (int j = t + 1; j <= m; ++j) {
				if (a[j][i]) {
					swap(a[j], a[t]);
					break;
				}
			}
		}
		if (!a[t][i]) continue;
		for (int j = 1; j <= m; ++j) {
			if (j != t) {
				if (a[j][i] == 1) {
					a[j] ^= a[t];
				}
				assert(a[j][i] == 0);
			}
		}
		c[i] = t;
		++t;
	}
	memset(b, 0, sizeof b);
	for (int i = 1; i <= n; ++i) {
		if (c[i] != 0) {
			int j = c[i];
			for (int k = 1; k <= m; ++k)
				if (k != j) {
					assert(a[k][i] == 0);
				}
			b[i] = (a[j][n + 1] == 1);
		}
		
	}
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin >> n >> m;
	for (int i = 1; i <= m; ++i) {
		for (int j = 1; j <= n + 1; ++j) {
			int x;
			std::cin >> x;
			a[i][j] = x;
		}
	}
	gauss();
	for (int i = 1; i <= n; ++i) {
		cout << b[i] << " \n"[i == n];
	}
}