Problem:
Score: 400 points

Problem statement

We have an H \times W grid whose squares are painted black or white. The square at the i-th row from the top and the j-th column from the left is denoted as (i, j).

Snuke would like to play the following game on this grid. At the beginning of the game, there is a character called Kenus at square (1, 1). The player repeatedly moves Kenus up, down, left or right by one square. The game is completed when Kenus reaches square (H, W) passing only white squares.

Before Snuke starts the game, he can change the color of some of the white squares to black. However, he cannot change the color of square (1, 1) and (H, W). Also, changes of color must all be carried out before the beginning of the game.

When the game is completed, Snuke's score will be the number of times he changed the color of a square before the beginning of the game. Find the maximum possible score that Snuke can achieve, or print -1 if the game cannot be completed, that is, Kenus can never reach square (H, W) regardless of how Snuke changes the color of the squares.

The color of the squares are given to you as characters s_{i, j}. If square (i, j) is initially painted by white, s_{i, j} is .; if square (i, j) is initially painted by black, s_{i, j} is #.

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.

Sample Input 1

3 3
..#
#..
...

Sample Output 1

2

The score 2 can be achieved by changing the color of squares as follows:

Sample Input 2

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

Sample Output 2

209

Solution in Ruby (2.3.3) (judge verdict: Wrong Answer)

def seek(node,history,step)
#	print  "#{node} start STEP = #{step}\n"
	if history.include?(getParent(node))
#		print "[INFO]#{getParent(node)}(#{node}) already searched.\n"
		return -1
	end
	history.push(getParent(node))

	#右方向シーク
	for	 n in getParent(node)[1]..W-1 do
#		print "looking for #{[node[0],n]} ...\n"
		if node[0]==H-1 && n==W-1
			return step+(node[1]-n).abs
		end

		#上を見る
		if node[0] > 0
			if S[node[0]-1][n] == '.'
				ret = seek([node[0]-1,n],history,step+(node[1]-n).abs+1)
				if ret != -1
					return ret
				end
			end
		end

		#下を見る
		if node[0] < H-1
			if S[node[0]+1][n] == '.'
				ret = seek([node[0]+1,n],history,step+(node[1]-n).abs+1)
				if ret != -1
					return ret
				end
			end
		end
	end

#	print  "#{node} end\n"
	return -1
end

def getParent(node)
	if node[1] == 0
		return node
	end

	py = node[1]
	#左方向シーク
	(node[1]-1).downto(0) do |n|
		if S[node[0]][n] == "."
			py-=1
		end
	end
	return [node[0],py]
end

H,W = gets.chomp.split.map(&:to_i)
S = Array.new(H,W)
H.times do |n|
	S[n] = gets.chomp.split("")
end
cnt = S.flatten.count(".")-1
node = [0,0]
history = []
step = 0
ret = seek(node,history,step)
print "#{ret == -1 ? -1 : cnt-ret}\n"