#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bitset<5005> f[5005];
int n, m, pos[5005];
int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= m; i++) {
		for (int j = 1; j <= n + 1; j++) {
			int x; scanf("%d", &x);
			f[i][j] = x;
		}
	}
	for (int i = 1, b = 1; i <= n; i++) {
		for (int j = b; j <= m; j++) {
			if (f[j][i]) {
				swap(f[j], f[b]);
				break;
			}
		}
		if (!f[b][i]) continue;
		for (int j = 1; j <= m; j++) {
			if (j == b) continue;
			if (f[j][i]) f[j] ^= f[b];
		}
		pos[i] = b++;
	}
	for (int i = 1; i <= n; i++) printf("%d%c", (int)f[pos[i]][n + 1], " \n"[i == n]);
	return 0;
}