#include <stdio.h>
#include <algorithm>
#include <bitset>
const int N = 5005;
int rd()
{
    int k = 0, f = 1;
    char c = getchar();
    while (c < '0' || c > '9')
        c = getchar();
    while (c >= '0' && c <= '9')
        k = (k << 1) + (k << 3) + (c ^ 48), c = getchar();
    return k;
}
int n, m, pos[N];
std::bitset<N> f[N];
void solve()
{
    for (int i = 1, b = 1; i <= n; i++)
    {
        for (int j = b; j <= m; j++)
            if (f[j][i])
            {
                swap(f[j], f[b]);
                break;
            }
        if (!f[b][i])
            continue;
        for (int j = 1; j <= m; j++)
        {
            if (j == b)
                continue;
            if (f[j][i])
                f[j] ^= f[b];
        }
        pos[i] = b++;
    }
    for (int i = 1; i <= n; i++, putchar(' '))
        putchar(f[pos[i]][n + 1] ^ '0');
}
int main()
{
    n = rd(), m = rd();
    for (int i = 1; i <= m; ++i)
        for (int j = 1; j <= n + 1; ++j)
            f[i][j] = rd();
    solve();
}