N,M=map(int,raw_input().split()) A=[raw_input() for i in range(N)] dir=[(1,0),(0,1),(-1,0),(0,-1)] sur=[(-1,-1),(1,1),(1,-1),(-1,1),(1,0),(0,1),(-1,0),(0,-1)] cnt=0 for i in range(N): for j in range(M): if A[i][j]=='.': cnt+=1 if i>0 and i+10 and j+1=0 and nb =0 and A[na][nb]=='.' and (arrived[na][nb]==False or (i== na and j==nb)): curCnt+=1 #print (na,nb) , arrived[na][nb]=True a=na b=nb ok=True if a==i and b==j: break na,nb=a+dir[(k+d)%4][0],b+dir[(k+d)%4][1] if ok == False or (a==i and b==j ): break #print if a==i and b==j and cnt == curCnt: print "YES" exit() print "NO"