Constraints

* H is an integer between 2 and 50 (inclusive).
* W is an integer between 2 and 50 (inclusive).
* s_{i, j} is `.` or `#` (1 \leq i \leq H, 1 \leq j \leq W).
* s_{1, 1} and s_{H, W} are `.`.

Input

Input is given from Standard Input in the following format:


H W
s_{1, 1}s_{1, 2}s_{1, 3} ... s_{1, W}
s_{2, 1}s_{2, 2}s_{2, 3} ... s_{2, W}
:   :
s_{H, 1}s_{H, 2}s_{H, 3} ... s_{H, W}


Output

Print the maximum possible score that Snuke can achieve, or print -1 if the game cannot be completed.

Examples

Input

3 3
..#
#..
...


Output

2


Input

3 3
..#
..
...


Output

2


Input

10 37
.....................................
...#...####...####..###...###...###..
..#.#..#...#.##....#...#.#...#.#...#.
..#.#..#...#.#.....#...#.#...#.#...#.
.#...#.#..##.#.....#...#.#.###.#.###.
.#####.####..#.....#...#..##....##...
.#...#.#...#.#.....#...#.#...#.#...#.
.#...#.#...#.##....#...#.#...#.#...#.
.#...#.####...####..###...###...###..
.....................................


Output

209
h,w=map(int, input().split())
s=[list(input()) for i in range(h)]

blackCnt=0
for i in s:
  for j in i:
    if j=="#":
      blackCnt+=1


#スタートをキューに格納
q=[[0,0]]
route=[[1,0],[0,1],[-1,0],[0,-1]]
visited = [[0 for i in range(w)] for j in range(h)]
visited[0][0]=1
cnt=0
while q:
  
  for _ in range(len(q)):
    x,y = q.pop(0)
    
    for i in range(4):
      nx, ny = x+route[i][0], y+route[i][1]
      #条件に合致すれば追加
      if 0<=nx<h and 0<=ny<w and visited[nx][ny] == 0 and s[nx][ny] != '#':
        q.append([nx,ny])
        visited[nx][ny]=1
  cnt+=1
  if visited[h-1][w-1]==1:
    print(w*h-cnt-1-blackCnt)
    exit()
print(-1)