using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace cswork
{
    class Program
    {
        class Scanner
        {
            string[] s;
            int i;

            char[] cs = new char[] { ' ' };

            public Scanner()
            {
                s = new string[0];
                i = 0;
            }

            public string next()
            {
                if (i < s.Length) return s[i++];
                string st = Console.ReadLine();
                while (st == "") st = Console.ReadLine();

                s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
                i = 0;
                return next();
            }

            public int nextInt()
            {
                return int.Parse(next());
            }

            public long nextLong()
            {
                return long.Parse(next());
            }

            public double nextDouble()
            {
                return double.Parse(next());
            }
        }

        public Program() { }

        static void Main(string[] args)
        {
            new Program().Omame();
        }

        Scanner cin = new Scanner();
        const int MAXIN = 1024;
        bool[] used = new bool[MAXIN];
        int[] perm = new int[MAXIN];

        List<int[]> permList = new List<int[]>();

        public void Permutation(int pos, int n, int length)
        {
            if (pos == n)
            {
                permList.Add((int[])perm.Clone());
            }

            for (int i = 0; i < n; i++)
            {
                if (!used[i])
                {
                    perm[pos] = i;
                    used[i] = true;
                    Permutation(pos + 1, n, length);
                    used[i] = false;
                }
            }
        }

        public static List<long> GeneratePrime(long max)
        {
            long prime;
            double sqrtMax = Math.Sqrt(max);
            var primeList = new List<long>();

            List<long> searchList = new List<long>();
            for (long i = 2; i <= max - 1; i++)
            {
                searchList.Add(i);
            }

            do
            {
                prime = searchList.First();
                primeList.Add(prime);
                searchList.RemoveAll(n => n % prime == 0);
            } while (prime < sqrtMax);

            primeList.AddRange(searchList);

            return primeList;
        }

        // 最小公倍数
        public static long Lcm(long a, long b)
        {
            return a * b / Gcd(a, b);
        }

        // ユークリッドの互除法 
        public static long Gcd(long a, long b)
        {
            if (a < b)
                return Gcd(b, a);
            while (b != 0)
            {
                var remainder = a % b;
                a = b;
                b = remainder;
            }
            return a;
        }

        public static readonly string Yes = "Yes";
        public static readonly string YES = "YES";
        public static readonly string No = "No";
        public static readonly string NO = "NO";
        public static readonly string OK = "OK";
        public static readonly string NG = "NG";

        void Omame()
        {
            long H = cin.nextLong();
            long W = cin.nextLong();
            string[,] maze = new string[H + 2, W + 2];

            StringBuilder sb = new StringBuilder();
            for (int i = 0; i < H; i++)
            {
                sb.Append(cin.next());
            }
            int count = 0;

            for (int i = 0; i < H + 2; i++)
            {
                for (int j = 0; j < W + 2; j++)
                {
                    if (i == 0 || i == H + 1 || j == 0 || j == W + 1)
                    {
                        maze[i, j] = ".";
                    }
                    else
                    {
                        maze[i, j] = sb[count].ToString(); ;
                        count++;
                    }
                }
            }

            for (int i = 1; i <= H; i++)
            {
                for (int j = 1; j <= W; j++)
                {
                    if (maze[i, j].Equals("."))
                    {
                        continue;
                    }
                    bool flag = false;
                    if (maze[i - 1, j].Equals("#")) flag = true;
                    if (maze[i + 1, j].Equals("#")) flag = true;
                    if (maze[i, j - 1].Equals("#")) flag = true;
                    if (maze[i, j + 1].Equals("#")) flag = true;
                    if (!flag)
                    {
                        Console.WriteLine(No);
                        return;
                    }
                }
            }
            Console.WriteLine(Yes);
        }
    }
}


Measured memory_bytes: 27780