#include <bits/stdc++.h>
#define filein(x) freopen(x".in", "r", stdin);
#define fileout(x) freopen(x, "w", stdout);
#define file(x) freopen(x".in", "r", stdin), freopen(x".out", "w", stdout);
#define files(x) freopen(x".in", "r", stdin), freopen(x".ans", "w", stdout);
template <typename T>
inline bool inrange(T x, T l, T r){return (l <= x) && (x <= r);}
template <typename T>
inline bool inrange(T l, T r, T L, T R){return (L <= l) && (r <= R);}
template <typename T>
inline T chkmin(T& a, T b){if (a > b) a = b; return a;}
template <typename T>
inline T chkmax(T& a, T b){if (a < b) a = b; return a;}
using namespace std; // my guiding star.
using pii = pair<int, int>;
using ll = long long;
using u64 = unsigned long long;
const int N = 2005;
int n, m, pos[N];
struct bitset3
{
	bitset<N> b0, b1, b2;
	inline bitset3 operator * (const int& rhs) const
	{
		if (rhs == 0) return bitset3(0, 0, 0);
		if (rhs == 1) return *this;
		return bitset3(b0, b2, b1);
	}
	inline bitset3 operator - (const bitset3& rhs) const
	{
		return bitset3((b0 & rhs.b0) | (b1 & rhs.b1) | (b2 & rhs.b2),
		               (b1 & rhs.b0) | (b2 & rhs.b1) | (b0 & rhs.b2),
		               (b2 & rhs.b0) | (b0 & rhs.b1) | (b1 & rhs.b2));
	}
	inline void set(int c, int x)
	{
		if (x == 0){b0.set(c); b1.set(c, 0); b2.set(c, 0);}
		if (x == 1){b0.set(c, 0); b1.set(c); b2.set(c, 0);}
		if (x == 2){b0.set(c, 0); b1.set(c, 0); b2.set(c);}
	}
	inline int operator[](const int& rhs)
	{
		if (b0.test(rhs)) return 0;
		if (b1.test(rhs)) return 1;
		if (b2.test(rhs)) return 2;
		return -1;
	}
	bitset3(bitset<N> b0, bitset<N> b1, bitset<N> b2) : b0(b0), b1(b1), b2(b2){}
	bitset3(){b0.set(); b1.reset(); b2.reset();}
}a[N];
int main()
{
	scanf("%d%d", &n, &m);
	for (int i=1; i<=m; i++)
		for (int j=1, x; j<=n+1; j++){scanf("%d", &x); a[i].set(j, x);}
	chkmax(m, n);
	for (int i=1, b=1; i<=n; i++)
	{
		for (int j=b+1; j<=m; j++)
			if (a[j][i]){swap(a[j], a[b]); break;}
		if (!a[b][i]) continue;
		for (int j=1; j<=m; j++)
			if ((b != j) && a[j][i]) a[j] = a[j] - a[b] * (a[j][i] * a[b][i] % 3);
		pos[i] = b++;
	}
	for (int i=1; i<=n; i++) putchar('0' + a[pos[i]][i] * a[pos[i]][n + 1] % 3), putchar(" \n"[i==n]);
	return 0;
}