import sys

def main():
    input = sys.stdin.read().split()
    ptr = 0
    N = int(input[ptr])
    ptr += 1
    M = int(input[ptr])
    ptr += 1
    s_list = []
    for _ in range(M):
        s = input[ptr].strip()
        ptr += 1
        val = 0
        for i in range(1, N+1):
            c = s[N - i]
            if c == '1':
                val |= 1 << (i-1)
        s_list.append(val)
    
    # Generate all pairs (i, j) where i < j
    for i in range(1, N+1):
        for j in range(i+1, N+1):
            found = False
            for s in s_list:
                bit_i = (s >> (i-1)) & 1
                bit_j = (s >> (j-1)) & 1
                if bit_i != bit_j:
                    found = True
                    break
            if not found:
                print("No")
                return
    print("Yes")

if __name__ == '__main__':
    main()