We have a canvas divided into a grid with H rows and W columns. The square at the i-th row from the top and the j-th column from the left is represented as (i, j).   Initially, all the squares are white. square1001 wants to draw a picture with black paint. His specific objective is to make Square (i, j) black when s_{i, j}= `#`, and to make Square (i, j) white when s_{i, j}= `.`.   However, since he is not a good painter, he can only choose two squares that are horizontally or vertically adjacent and paint those squares black, for some number of times (possibly zero). He may choose squares that are already painted black, in which case the color of those squares remain black.   Determine if square1001 can achieve his objective.
H, W = list(map(int, input().split(' ')))
import numpy as np
import sys
grid = np.zeros((H, W))
for h in range(H):
  grid[h,:] = [0 if g == '.' else 1 for g in input()]
  
# print(grid)
for h in range(H):
  for w in range(W):
    if grid[h, w] == 0:
      continue
    
    around = []
    if h > 0:
      around.append(grid[h-1, w])
    if w > 0:
      around.append(grid[h, w-1])
    if h < H-1:
      around.append(grid[h+1, w])
    if w < W-1:
      around.append(grid[h, w+1])
    if 1 in around:
      pass
    else:
      # print(h, w, around)
      print('No')
      sys.exit()
print('yes')

h, w = list(map(int, input().split()))
s = [input() for _ in range(h)]

adj = [(1, 0), (0, 1), (-1, 0), (0, -1)]
non_adj = 0
for y in range(h):
    for x in range(w):
        if s[y][x] == '.':
            continue
        n_adj = 0
        for dx, dy in adj:
            i, j = y+dy, x+dx
            if i < 0 or i >= h or j < 0 or j >= w:
                continue
            if s[i][j] == '#':
                n_adj += 1
        if n_adj == 0:
            non_adj += 1
# print(non_adj)
if non_adj == 0:
    print('Yes')
else:
    print('No')