#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
typedef pair<int, int> P;
typedef long long ll;
typedef unsigned long long ull;

#define rep(i,n)  for(int (i) = 0;(i) < (n);(i)++)
#define clr(a) memset((a), 0 ,sizeof(a))
#define mclr(a) memset((a), -1 ,sizeof(a))
#define all(a)  (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (sizeof(a))
#define Fill(a,v) fill((int*)a,(int*)(a+(SZ(a)/SZ(*(a)))),v)
bool cheak(int x, int y, int xMax, int yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
const int dx[4] = { -1, 0, 1, 0 }, dy[4] = { 0, 1, 0, -1 };
const int mod = 1000000007;
const int INF = 2147483647;


int main()
{
	int h,w;
	cin >> h >> w;
	string s[101];
	rep(i, h){
		cin >> s[i];
	}
	rep(i, h){
		rep(j, w){
			if (s[i][j] == '.'){
				if (i == h - 1 && j == w - 1)
				{
					cout << "NO" << endl;
					return 0;
				}
			}
			else
			goto SINITAI;
		}
	}

	SINITAI:;

	for (int k = -h*2; k < h*2; k++){
		for (int l = -w*2; l < w*2; l++){
			if (!(k == 0 && l == 0)){
				bool f[51][51]; clr(f);
				rep(i, h){
					rep(j, w){
						if (s[i][j] == '.')
							f[i][j] = true;
					}
				}

				for (int i = 0; i < h; i++){
					for (int j = 0; j < w; j++){


						if (s[i][j] == '#' && !f[i][j]){

							if (cheak(i + k, j + l, h, w)){
								if (s[i + k][j + l] == '#' && !f[i + k][j + l]){
									f[i][j] = true;
									f[i + k][j + l] = true;
									continue;
								}
							}

							if (cheak(i - k, j - l, h, w)){
								if (s[i - k][j - l] == '#' && !f[i - k][j - l]){
									f[i][j] = true;
									f[i - k][j - l] = true;
									continue;
								}
							}
						}
					}
				}

				rep(i, h){
					rep(j, w){
						if (f[i][j]){
							if (i == h - 1 && j == w - 1){
								cout << "YES" << endl;
								return 0;
							}
						}
						else
							goto LABEL;
					}
				}

			LABEL:;
			}
		}
	}



	
	cout << "NO" << endl;

	return 0;
}