# coding: utf-8
# Your code here!
H,W=map(int,input().split())
l=[]

def dfs(h,w):
    judge=True
    if l[h][w]!="#":
        return
    l[h][w]="@"
    if h!=H-1:
        if l[h+1][w]!=".":
            dfs(h+1,w)
            judge=False
    if w!=W-1: 
        if l[h][w+1]!=".":
            dfs(h,w+1)
            judge=False
    if h!=0:
        if l[h-1][w]!=".":
            dfs(h-1,w)
            judge=False
    if w!=0:
        if l[h][w-1]!=".":
            dfs(h,w-1)
            judge=False
    if judge:
        print("No")
        exit()
    else:
        l[h][w]="."
        return

for _ in range(H):
    l.append(list(input()))
print("blue")
for i in range(H):
    for j in range(W):
        dfs(i,j)

print("Yes")
