N, M = map(int, input().split())
S = [input() for _ in range(M)]

for i in range(M):
    num = 0
    for j in range(N):
        if S[i][j] == "1":
            num |= 1<<j
    S[i] = num

SET = set(S)
if (1<<N)-1 not in SET or 0 not in SET:
    exit(print("No"))

for i in range(M-1):
    for j in range(i+1, M):
        if S[i]&S[j] not in SET:
            exit(print("No"))

dp = [[False]*(1<<N) for _ in range(M+1)]
dp[0][0] = True
for i in range(M):
    for j in range(1<<N):
        if not dp[i][j]:
            continue
        dp[i+1][j] = dp[i][j]
        dp[i+1][j|S[i]] = dp[i][j]
for i in range(1<<N):
    if dp[i][j] and i not in SET:
        print("No")
        break
else:
    print("Yes")