Problem: 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

Solution (in CPP):

Solution:
#include<bits/stdc++.h>
using namespace std;
#define P pair<int, int>
int n, m, wh, ans, dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
char s[55][55];
queue<pair<P, int> > qu;

int main(){
	scanf("%d %d\n", &n, &m);
	for(int i = 0; i < n; i++){
		scanf("%s", s[i]);
		for(int j = 0; j < m; j++) if(s[i][j] == '.') wh++;
	}
	if(s[0][0] == '.') qu.push(pair<P, int>(P(0, 0), 1));
	while(!qu.empty()){
		pair<P, int> tmp = qu.front(); qu.pop();
		if(tmp.first.first == n-1 && tmp.first.second == m-1){
			ans = tmp.second;
			break;
		}
		for(int i = 0; i < 4; i++) {
			int x = tmp.first.first + dx[i], y = tmp.first.second + dy[i];
			if(x < 0 || x >= n || y < 0 || y >= m || s[x][y] == '#') continue;
			qu.push(pair<P, int>(P(x, y), tmp.second + 1));
			s[x][y] = '#';
		}
	}
	printf("%d\n", ans ? wh - ans : -1);
}