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 java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int h = sc.nextInt();
		int w = sc.nextInt();
		char[][] s = new char[h][w];
		int blankCount = 0;

		for (int i = 0; i < h; i++) {
			String str = sc.next();
			for (int j = 0; j < w; j++) {
				s[i][j] = str.charAt(j);
				if (s[i][j] == '.') {
					blankCount++;
				}
			}
		}

		// BFS
		Queue<Pos> queue = new LinkedList<Pos>();
		queue.add(new Pos(0, 0, 0));
		s[0][0] = '/';
		int totalStep = -1;
		while(queue.peek() != null) {
			Pos p = queue.poll();
			if (p.y == h - 1 && p.x == w - 1) {
				totalStep = p.step;
				break;
			} else {
				// Up
				if (p.y - 1 >= 0 && s[p.y - 1][p.x] == '.') {
					s[p.y - 1][p.x] = '/';
					queue.add(new Pos(p.y - 1, p.x, p.step + 1));
				}
				// Down
				if (p.y + 1 < h && s[p.y + 1][p.x] == '.') {
					s[p.y + 1][p.x] = '/';
					queue.add(new Pos(p.y + 1, p.x, p.step + 1));
				}
				// Left
				if (p.x - 1 >= 0 && s[p.y][p.x - 1] == '.') {
					s[p.y][p.x - 1] = '/';
					queue.add(new Pos(p.y, p.x - 1, p.step + 1));
				}
				// Right
				if (p.x + 1 < w && s[p.y][p.x + 1] == '.') {
					s[p.y][p.x + 1] = '/';
					queue.add(new Pos(p.y, p.x + 1, p.step + 1));
				}
			}
		}

		if (totalStep == -1) {
			System.out.println(totalStep);
		} else {
			System.out.println(blankCount - totalStep - 1);
		}
	}

	private static class Pos {
		int y;
		int x;
		int step;

		Pos(int y, int x, int step) {
			this.y = y;
			this.x = x;
			this.step = step;
		}
	}
}
