from collections import deque

H, W = map(int, input().split())
S = [input() for _ in range(H)]

visited = [[-1]*W for _ in range(H)]
visited[0][0] = (0, 0)
que = deque()
que.append((0, 0))
direction = [(-1,0),(0,1),(1,0),(0,-1)]
while que:
    h, w = que.popleft()
    wcnt, hcnt = visited[h][w]
    for dh, dw in direction:
        nh, nw = h+dh, w+dw
        if 0<=nh<H and 0<=nw<W and S[nh][nw] == ".":
            if dh != 0:
                if visited[nh][nw] == -1:
                    visited[nh][nw] = (wcnt, hcnt+1)
                    que.appendleft((nh, nw))
                else:
                    nwcnt, nhcnt = visited[h][w]
                    if wcnt < nwcnt or wcnt == nwcnt and hcnt+1 < nhcnt:
                        visited[nh][nw] = (wcnt, hcnt+1)
                        que.appendleft((nh, nw))
            else:
                if visited[nh][nw] == -1:
                    visited[nh][nw] = (wcnt+1, hcnt)
                    que.append((nh, nw))
                else:
                    nwcnt, nhcnt = visited[h][w]
                    if wcnt+1 < nwcnt or wcnt+1 == nwcnt and hcnt < nhcnt:
                        visited[nh][nw] = (wcnt+1, hcnt)
                        que.append((nh, nw))

if visited[-1][-1] != -1:
    print("Yes")
    print(*visited[-1][-1])
else:
    print("No")