#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define R(i, x, y) for (int i = (x); i >= (y); i--)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
bool Mbe;

const int N = 5e3 + 5;

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

void Gauss() {
	int p = 1;
	F (i, 1, n) {
		if (p > m) break;
		F (j, p + 1, m) {
			if (A[j][i]) {
				swap(A[p], A[j]);
				break;
			}
		}
		if (!A[p][i]) continue;
		F (j, 1, m) {
			if (j != p && A[j][i]) {
				A[j] ^= A[p];
			}
		}
		c[i] = p++;
	}
}

void solve() {
	cin >> n >> m;
	F (i, 1, m) {
		F (j, 1, n + 1) {
			int x;
			cin >> x;
			A[i][j] = x;
		}
	}
	m = max(n, m);
	Gauss();
	F (i, 1, n) {
		cout << A[c[i]][n + 1] << ' ';
	}
}

bool Med;
int main() {
	// FIO("");
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cerr << (&Mbe - &Med) / 1048576.0 << " MB\n";
	int T = 1;
	// cin >> T;
	while (T--) solve();
	cerr << (int)(1e3 * clock() / CLOCKS_PER_SEC) << " ms\n";
	return 0;
}