#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned ll;using pii=pair<int,int>;
const int N=5e3+5,M=N*30+5,K=1000+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,m,vis[N];
bitset<N> A[N],ans,B[N];
void Solve(){
	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);
		A[j][i]=x&1;
	}
	for(int i=1;i<=n;i++) B[i][i]=1;
	for(int i=1;i<=m;i++){
		int id=0;
		for(int j=1;j<=n;j++) if(!vis[j]&&A[j][i]){id=j;break;}
		if(!id) continue;
		vis[id]=1;
		for(int j=id+1;j<=n+1;j++) if(!vis[j]&&A[j][i]) A[j]^=A[id],B[j]^=B[id];
	}
	for(int i=1;i<=n;i++) printf("%d ",int(B[n+1][i]));
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}