H,W=map(int, input().split())
A=[]
for i in range(H):
  X=input()
  A.append(X)

from collections import deque
D={}
D[(0,0)]=[0]*21 
D[(0,0)][1]=1
dy,dx=[1,0],[0,1]
for i in range(H+W-2):
  DD={}
  for d in D:
    y,x=d 
    for i in range(2):
      ny,nx=y+dy[i],x+dx[i]
      if 0<=ny<H and 0<=nx<W and A[ny][nx]!='#':
        if (ny,nx) not in DD:
          DD[(ny,nx)]=[0]*21
        if A[ny][nx]=='o':
          for j in range(20):
            DD[(ny,nx)][j+1]+=D[(y,x)][j]
        else:
          for j in range(20):
            DD[(ny,nx)][j]+=D[(y,x)][j+1]
  D=DD 
ans=0
for d in D:
  ans+=sum(D[d])
print(ans)