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
import queue
h,w=map(int,input().split())
INF=10**9
s=[[-1]* w for _ in range(h)]
b=0
for i in range(h):
	x=input()
	for j in range(w):
		if x[j]==".":
			s[i][j] = INF
		else:
			b+=1

q=queue.Queue()
s[0][0]=0
q.put((0,0))

def test(x,y,t):
	if 0<=x<h and 0<=y<w:
		u=s[x][y]
		if t<u:
			s[x][y]=t
			q.put((x,y))

while not q.empty():
	x,y=q.get()
	t=s[x][y]
	test(x+1,y,t+1)
	test(x-1,y,t+1)
	test(x,y+1,t+1)
	test(x,y-1,t+1)

x=s[h-1][w-1]
print(-1 if x==INF else h*w-b-x-1)