n, m = map(int, input().split())

def main(a):
    a = [a[i] for i in range(n)]
    rep = 0
    cnt = 1
    while a:
        if a.pop() == "1":
            rep += cnt
        cnt *= 2
    return rep

A = [main(input()) for _ in range(m)]
B = [0] * (1 << n)
for a in A:
    B[a] = 1

f = 1
t = 1
OK = [0] * (1 << n)
for bit in range(1 << n):
    if B[bit] ^ 1:
        continue
    if t:
        OK[bit] = 1
        t = 0
    if not OK[bit]:
        f = 0
    for i in range(n):
        if not bit >> i & 1:
            if not B[bit | 1 << i]:
                f = 0
            else:
                OK[bit | 1 << i] = 1

if f and not B[0]:
    print("Yes")
else:
    print("No")