n,m=map(int,input().split())
c=[0]*(1<<n)
for i in range(m):
  c[int(input(),2)]=1
if c[0]:
  print("No")
  exit()
q=c[:]
for j in range(n):
  for i in reversed(range(1<<n)):
    if (i>>j)&1==0:
      q[i]&=q[i|(1<<j)]
if not all((not c[i]) or q[i] for i in range(1<<n)):
  print("No")
  exit()
q=c[:]
for j in range(n):
  for i in reversed(range(1<<n)):
    if (i>>j)&1==0:
      q[i]+=q[i|(1<<j)]
for i in range(1<<n):
  q[i]**=2
for j in range(n):
  for i in range(1<<n):
    if (i>>j)&1==0:
      q[i]-=q[i|(1<<j)]
if not all((not (q[i]>0)) or c[i] for i in range(1<<n)):
  print("No")
  exit()
print("Yes")