#include<bits/stdc++.h>
using namespace std;
#define ll long long
namespace IO{//by cyffff
	int len=0;
	char ibuf[(1<<21)+1],*iS,*iT,out[(1<<25)+1];
	#if ONLINE_JUDGE
	#define gh() (iS==iT?iT=(iS=ibuf)+fread(ibuf,1,(1<<21)+1,stdin),(iS==iT?EOF:*iS++):*iS++)
 	#else
	#define gh() getchar()
	#endif
	#define reg register
	inline int read(){
		reg char ch=gh();
		reg int x=0;
		reg char t=0;
		while(ch<'0'||ch>'9')   t|=ch=='-',ch=gh();
		while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=gh();
		return t?-x:x;
	}
	inline void putc(char ch){
		out[len++]=ch;
	}
	template<class T>
	inline void write(T x){
		if(x<0)putc('-'),x=-x;
		if(x>9)write(x/10);
		out[len++]=x%10+48;
	}
	inline void flush(){
		fwrite(out,1,len,stdout);
		len=0;
	}
	inline char getc(){
		char ch=gh();
		while(ch<'A'||ch>'Z') ch=gh();
		return ch;
	}
}
using IO::read;
using IO::write;
using IO::flush;
using IO::getc;
using IO::putc;
const int N=5e3+10;
int n,m,ans[N];
bitset<N>b[N];
inline void solve(){
	for(int i=1;i<=min(n,m);i++){
		if(!b[i][i])
			for(int j=1;j<=m;j++)
				if(b[j][i]&&(!b[j][j]||j>i)){
					swap(b[i],b[j]);
					break;
				}
		if(!b[i][i]) continue;
		for(int j=1;j<=m;j++){
			if(i==j||!b[j][i]) continue;
			b[j]^=b[i];
		}
	}
}
int main(){
	n=read(),m=read();
	for(int i=1;i<=m;i++)
		for(int j=1;j<=n+1;j++)
			b[i][j]=read();
	m=max(m,n);
	solve();
	for(int i=1;i<=n;i++)
		write(b[i][n+1]),putc(' ');
	flush();
}