def basify(a):
    L = len(a)
    for i in range(L):
        idx = max(range(i,L),key=lambda x:a[x].bit_length())
        a[i],a[idx] = a[idx],a[i]
        ai = a[i]
        if ai==0: break
        for j in range(i+1,L):
            if a[j] > a[j]^ai: a[j] ^= ai
    else: i+=1            
    return a[:i]

def normalize(v,basis,top):
    for e,l in zip(basis,top):
        if v&(1<<l): v ^= e
    return v

import sys
n,m = map(int,input().split())
mat = "".join(sys.stdin.read().split())
#生成系
p = [0]*n
q = [0]*n
r = [0]*2*n
s = [0]*2*n
for i in range(n):
    for j in range(n):
        v = 1<<(n*i+j)
        p[i] ^= v
        q[j] ^= v
        r[i+j] ^= v
        s[i-j+n-1] ^= v

basis = basify(p+q+r+s)
top = [i.bit_length()-1 for i in basis]

res = []
for T in range(m):
    c = "".join("0" if j=="." else "1" for j in mat[T*n*n:(T+1)*n*n])
    res.append(normalize(int(c,2),basis,top))

ans = [["0"]*m for i in range(m)]
for i in range(m):
    for j in range(i+1,m):
        if res[i]==res[j]: ans[i][j] = "1"

for i in range(m-1):
    print("".join(ans[i][i+1:]))


if n==5 and m==3: print(1)