import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math

_INPUT = """\
6
1 1
0
1 1
1
1 2
0
1
3 4
000
011
110
111
"""

def input():
  return sys.stdin.readline()[:-1]

def solve(test):
  N,M=map(int, input().split())
  S=[input() for _ in range(M)]
  S=[sum([1<<j for j in range(N) if S[i][j]=='1']) for i in range(M)]
  S2=set(S)
  ans='Yes'
  if (1<<N)-1 not in S2 or 0 not in S2:
    ans='No'
  for i in range(M):
    if ans=='No':
      break
    for j in range(i+1,M):
      if S[i]&S[j] not in S2:
        ans='No'
        break
      if S[i]|S[j] not in S2:
        ans='No'
        break
  print(ans)

def random_input():
  from random import randint,shuffle
  N=randint(1,10)
  M=randint(1,N)
  A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
  shuffle(A)
  return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3

def simple_solve():
  return []

def main(test):
  if test==0:
    solve(0)
  elif test==1:
    sys.stdin = io.StringIO(_INPUT)
    case_no=int(input())
    for _ in range(case_no):
      solve(0)
  else:
    for i in range(1000):
      sys.stdin = io.StringIO(random_input())
      x=solve(1)
      y=simple_solve()
      if x!=y:
        print(i,x,y)
        print(*[line for line in sys.stdin],sep='')
        break

#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)