import sys
input = sys.stdin.readline

def solve():
	n = int(input())
	m = int(input())
	lis = [[0] * 4 for _ in [0] * m]
	for i in range(m):
		s = ''.join(['0'] * (256 - n) + [input().rstrip()])
		lis[i] = [int(s[j << 6: (j + 1) << 6], 2) for j in range(4)]

	MAX_INT = (1 << 64) - 1
	s = ''.join(['0'] * (256 - n) + ['1'] * n)
	LIS = [int(s[j << 6: (j + 1) << 6], 2) for j in range(4)]

	for i in range(n):
		a = LIS[:]
		b = [0] * 4
		p = 3 - (i >> 6)
		q = i & 63
		for j in range(m):
			if((lis[j][p] >> q) & 1):
				for k in range(4):
					a[k] &= lis[j][k]
			else:
				for k in range(4):
					b[k] |= lis[j][k]
		for j in range(4):
			# print(bin(a[j]), bin(~(b[j] | (1 << q)) & MAX_INT))
			if(a[j] & ~(b[j] | (1 << q)) & MAX_INT):
				print("No")
				exit(0)
	print("Yes")

solve()