#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e9 + 10;
const long long mod = 1e9 + 7;
const int maxn = 1e3 + 10;
int n, m;
char a[maxn][maxn];
int mark[maxn][maxn];
int main() {
  std::ios::sync_with_stdio(0);
  ;
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> a[i][j];
    }
  }
  for (int i = 1; i < n - 1; i++) {
    for (int j = 1; j < m - 1; j++) {
      if (a[i - 1][j - 1] == '#' && a[i - 1][j] == '#' &&
          a[i - 1][j + 1] == '#' && a[i][j - 1] == '#' && a[i][j + 1] == '#' &&
          a[i + 1][j - 1] == '#' && a[i + 1][j] == '#' &&
          a[i + 1][j + 1] == '#') {
        mark[i - 1][j - 1] = mark[i - 1][j] = mark[i - 1][j + 1] =
            mark[i][j - 1] = mark[i][j + 1] = mark[i + 1][j - 1] =
                mark[i + 1][j] = mark[i + 1][j + 1] = 1;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (a[i][j] == '#' && mark[i][j] == 0) {
        cout << "No";
        return 0;
      }
    }
  }
  cout << "Yes";
}
