// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#include <bits/stdc++.h>
// #define int long long
#define i64 long long
#define pii pair <int, int> 
using namespace std;
inline int read(void) {
    int x=0,sgn=1; char ch=getchar();
    while(ch<48||57<ch) {if(ch==45)sgn=0;ch=getchar();}
    while(47<ch&&ch<58) {x=x*10+ch-48;   ch=getchar();}
    return sgn? x:-x;
}
inline bool read1(void) {
    char ch=getchar();
    while(ch<48||57<ch) ch=getchar();
    return ch=='1';
}
void write(int x) {
    if(x<0) putchar('-'),x=-x;
    if(x>9) write(x/10);
    putchar(x%10+'0');
}
/*
    write((Ans%p+p)%p); pls
*/
int n,m;
bitset <5000> f[5000],b[5000],g[5000],res,cur;
signed main() {
    // freopen("localinput","r",stdin);
    // freopen("localoutput","w",stdout);
    n=read(); m=read();
    for(int i=0; i<m; ++i) {
        for(int u=0; u<n; ++u) f[u][i]=read1();
        cur[i]=read1();
    }
    for(int i=0; i<n; ++i) {
        bitset <5000> now;
        now.reset();
        now[i]=1;
        while(f[i].any()) {
            int u=f[i]._Find_first();
            if(b[u][u]) f[i]^=b[u],now^=g[u];
            else {
                b[u]=f[i];
                g[u]=now;
                break;
            }
        }
    }
    while(cur.any()) {
        int u=cur._Find_first();
        cur^=b[u];
        res^=g[u];
    }
    for(int i=0; i<n; ++i) write(res[i]),putchar(' ');
    puts(""); 
    // fprintf(stderr,"%.4lf\n",1.0*clock()/CLOCKS_PER_SEC);
    return 0;
}