PYTHON

n, q = map(int, input().split())

for _ in range(q):
    s = input().strip()
    valid = True
    # 检查是否有相邻的1
    for i in range(len(s) - 1):
        if s[i] == '1' and s[i+1] == '1':
            valid = False
            break
    if not valid:
        print("No")
        continue
    
    # 检查是否可以添加更多学生
    can_add = False
    s_list = list(s)
    for i in range(len(s_list)):
        if s_list[i] == '0':
            # 尝试在i位置放置1
            s_list[i] = '1'
            # 检查是否有相邻的1
            has_adjacent = False
            if i > 0 and s_list[i-1] == '1':
                has_adjacent = True
            if i < len(s_list) - 1 and s_list[i+1] == '1':
                has_adjacent = True
            if not has_adjacent:
                can_add = True
                break
            # 恢复
            s_list[i] = '0'
    print("No" if can_add else "Yes")