#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long INF = 2000000015;
const long long MAX = 510000;
const long long MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
long long jousu(long long x00, long long y00) {
  long long z00 = 1;
  for (long long i = 0; i < y00; i++) {
    z00 *= x00;
  }
  return z00;
}
long long keta(long long x00) {
  long long z00 = x00;
  long long w00 = 0;
  while (z00 != 0) {
    z00 /= 10;
    w00++;
  }
  return w00;
}
long long krag(double xx) { return INF - (long long)(INF - xx); }
long long modinv(long long a, long long m) {
  long long b = m, u = 1, v = 0;
  while (b) {
    long long t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= m;
  if (u < 0) u += m;
  return u;
}
long long modpow(long long a, long long n) {
  long long res = 1;
  while (n > 0) {
    if (n & 1) res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
long long com(long long xx, long long yy) {
  long long zz = 1;
  for (long long i = xx; i > xx - yy; i--) {
    zz *= i;
    zz %= mod;
  }
  for (long long i = 1; i <= yy; i++) {
    zz *= modinv(i, mod);
    zz %= mod;
  }
  return zz;
}
long long gcd(long long xx, long long yy) {
  long long p = xx;
  long long q = yy;
  if (q > p) swap(p, q);
  while (p % q != 0) {
    p %= q;
    swap(p, q);
  }
  return q;
}
long long lcm(long long xx, long long yy) { return xx * yy / gcd(xx, yy); }
bool prime(long long xx) {
  long long a = xx;
  for (long long i = 2; i * i <= xx; i++) {
    if (xx % i == 0) {
      return 0;
    }
  }
  return 1;
}
vector<long long> vec(200004);
vector<long long> vec2(200004);
long long sum(long long xx) {
  if (xx == 0) {
    return vec2[0];
  }
  return vec2[xx] + sum(vec[xx]);
}
signed main() {
  long long h, w;
  cin >> h >> w;
  vector<vector<char>> vec(h + 2, vector<char>(w + 2, '.'));
  for (long long i = 1; i < h + 1; i++) {
    for (long long j = 1; j < w + 1; j++) {
      cin >> vec[i][j];
    }
  }
  for (long long i = 1; i < h + 1; i++) {
    for (long long j = 1; j < w + 1; j++) {
      if (vec[i][j] == '#' && vec[i][j + 1] != '#' && vec[i][j - 1] != '#' &&
          vec[i - 1][j] != '#' && vec[i + 1][j] != '#') {
        cout << i << j << "\n";
        cout << "No"
             << "\n";
        return 0;
      }
    }
  }
  cout << "Yes"
       << "\n";
}
