import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
# md = 998244353
md = 10**9+7

from collections import deque

n, D = MI()
to = [[] for _ in range(n)]
for u in range(n):
    vv = BI()
    for v, b in enumerate(vv[u:], u):
        if b == 49:
            to[u].append(v)
            to[v].append(u)
# print(to)


def dijk(s):
    dist = [inf]*n*2
    q = deque()
    q.append((s*2, 0))
    dist[s*2] = 0
    while q:
        u, d = q.popleft()
        u, t = divmod(u, 2)
        nt = 1-t
        for v in to[u]:
            if dist[v*2+nt] != inf: continue
            dist[v*2+nt] = d+1
            if d+1 > D:
                print("No")
                exit()
            q.append((v*2+nt, d+1))
    if max(dist)==inf:
        print("No")
        exit()

for u in range(n): dijk(u)

print("Yes")