백준/python 3109 빵집

# @Date : 2024-10-10 12:31:02
# @Author : ecodev
# @Link : http://ecodev-blog.vercel.app

import sys
input = sys.stdin.readline

############ ---- Input Functions ---- ############


def inp():
    return(int(input()))


def inlt():
    return(list(map(int, input().split())))


def insr():
    s = input()
    return(list(s[:len(s) - 1]))


def invr():
    return(map(int, input().split()))


r, c = invr()
graph = [insr() for _ in range(r)]
path = [(-1, 1), (0, 1), (1, 1)]


def DFS(x, y):
    if y == c - 1:
        return True  # 도달하자마자 바로 끝내기

    for i in range(3):
        nx = x + path[i][0]
        ny = y + path[i][1]
        if 0 <= nx < r and 0 <= ny < c and not visited[nx][ny] and graph[nx][ny] == ".":
            visited[nx][ny] = True
            if DFS(nx, ny):
                return True

    return False


visited = [[False] * c for _ in range(r)]

ans = 0
for x in range(r):
    if DFS(x, 0):
        ans += 1

print(ans)