def AND_Convolution(polynomial0,polynomial1,mod=0):
    n=(max(len(polynomial0),len(polynomial1))-1).bit_length()
    polynomial0=[x for x in polynomial0]+[0]*((1<<n)-len(polynomial0))
    polynomial1=[x for x in polynomial1]+[0]*((1<<n)-len(polynomial1))
    for i in range(n):
        for bit in range(1<<n):
            if not bit&1<<i:
                polynomial0[bit]+=polynomial0[bit^1<<i]
                polynomial1[bit]+=polynomial1[bit^1<<i]
                if mod:
                    polynomial0[bit]%=mod
                    polynomial1[bit]%=mod
    if mod:
        convolution=[x*y%mod for x,y in zip(polynomial0,polynomial1)]
    else:
        convolution=[x*y for x,y in zip(polynomial0,polynomial1)]
    for i in range(n):
        for bit in range(1<<n):
            if not bit&1<<i:
                convolution[bit]-=convolution[bit^1<<i]
                if mod:
                    convolution[bit]%=mod
    return convolution

def OR_Convolution(polynomial0,polynomial1,mod=0):
    n=(max(len(polynomial0),len(polynomial1))-1).bit_length()
    polynomial0=[x for x in polynomial0]+[0]*((1<<n)-len(polynomial0))
    polynomial1=[x for x in polynomial1]+[0]*((1<<n)-len(polynomial1))
    for i in range(n):
        for bit in range(1<<n):
            if bit&1<<i:
                polynomial0[bit]+=polynomial0[bit^1<<i]
                polynomial1[bit]+=polynomial1[bit^1<<i]
                if mod:
                    polynomial0[bit]%=mod
                    polynomial1[bit]%=mod
    if mod:
        convolution=[x*y%mod for x,y in zip(polynomial0,polynomial1)]
    else:
        convolution=[x*y for x,y in zip(polynomial0,polynomial1)]
    for i in range(n):
        for bit in range(1<<n):
            if bit&1<<i:
                convolution[bit]-=convolution[bit^1<<i]
                if mod:
                    convolution[bit]%=mod
    return convolution


N,M=map(int,input().split())
N,M=M,N
S=[]
for n in range(N):
    s=list(map(int,list(input())))
    bit=0
    for m in range(M):
        bit|=s[m]<<m
    S.append(bit)
if not (1<<M)-1 in S:
    print("No")
    exit()
if not 0 in S:
    print("No")
    exit()
C=[0]*(1<<M)
for s in S:
    C[s]=1
CC=AND_Convolution(C,C)
for n in range(1<<M):
    if CC[n]:
        CC[n]=1
if C!=CC:
    print("No")
    exit()
C=[0]*(1<<M)
for s in S:
    C[s]=1
C[0]=1
for _ in range(20):
    CC=OR_Convolution(C,C)
for n in range(1<<M):
    if CC[n]:
        CC[n]=1
if C!=CC:
    print("No")
    exit()
print("Yes")