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
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;

int main() {
	int h, w;
	cin >> h >> w;
	vector<string> s(h);
	rep(i, h) cin >> s[i];
	vector<vector<int>> d(h, vector<int>(w, -1));
	d[0][0] = 0;
	queue<pii> q;
	q.push({0, 0});
	while (!q.empty()) {
		pii p = q.front();
		q.pop();
		int y, x;
		tie(y, x) = p;
		vector<int> dy = {0, 1, 0, -1};
		vector<int> dx = {1, 0, -1, 0};
		rep(i, 4) {
			int ny = y + dy[i];
			int nx = x + dx[i];
			if (ny < 0 || ny >= h || nx < 0 || nx >=w) continue;
			if (s[ny][nx] == '#' || d[ny][nx] != -1) continue;
			d[ny][nx] = d[y][x] + 1;
			q.push({ny, nx});
		}
	}
	int ans = h * w;
	rep(i, h) rep(j, w) {
		if (s[i][j] == '#') ans--;
	}
	if (d[h - 1][w - 1] != -1) cout << ans - d[h - 1][w - 1] - 1 << endl;
	else cout << -1 << endl;
	return 0;
}