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


def f(i, j, k):
    return (i * w + j) * (h + w + 1) + k


dp = [0] * (h * w * (h + w + 1))
dp[f(0, 0, 1)] = 1
for i in range(h):
    for j in range(w):
        for k in range(h + w + 1):
            if dp[f(i, j, k)] == 0:
                continue
            if i + 1 < h and S[i + 1][j] == "o":
                dp[f(i + 1, j, k + 1)] += dp[f(i, j, k)]
            elif i + 1 < h and S[i + 1][j] == "x" and k > 0:
                dp[f(i + 1, j, k - 1)] += dp[f(i, j, k)]
            if j + 1 < w and S[i][j + 1] == "o":
                dp[f(i, j + 1, k + 1)] += dp[f(i, j, k)]
            elif j + 1 < w and S[i][j + 1] == "x" and k > 0:
                dp[f(i, j + 1, k - 1)] += dp[f(i, j, k)]

ans = 0
for k in range(h + w + 1):
    ans += dp[f(h - 1, w - 1, k)]
print(ans)