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.awt.Point;
import java.util.ArrayDeque;
import java.util.Scanner;
//https://abc007.contest.atcoder.jp/submissions/1889827
public class Main {
	static final int[] dx={0,1,0,-1}, dy={-1,0,1,0};
	public static void main(String[] args) {
		final Scanner sc = new Scanner(System.in);
		int h = sc.nextInt() + 2;
		int w = sc.nextInt() + 2;
		Point start = new Point(1, 1);
		Point goal = new Point(h-2, w-2);
		int all = 0;
		char[][] map = new char[h][w];
		StringBuilder sb = new StringBuilder();
		for(int i = 0; i < w; i++) sb.append('#');
		map[0]=sb.toString().toCharArray();
		map[h-1]=sb.toString().toCharArray();
		for (int i = 1; i < h-1; i++) {
			map[i] = ("#"+sc.next()+"#").toCharArray();
			for(int j = 1; j < w-1; j++) {
				if(map[i][j] == '.') all++;
			}
		}
		ArrayDeque<Point> deque = new ArrayDeque<>();
		deque.add(start);
		int count = 0;
		map[1][1] = '#';
		int nx, ny;
		outer:for(;true;count++) {
			for(int i = deque.size(); i > 0; i--) {
				Point poll = deque.poll();
				if(poll.equals(goal)) {
					break outer;
				}
				if(count > 2600) {
					System.out.println(-1);
					return;
				}
				for(int j = 0; j < 4; j++) {
					nx = poll.x+dx[j];
					ny = poll.y+dy[j];
					if(map[nx][ny] == '.') {
						deque.add(new Point(nx,ny));
						map[nx][ny] = '#';
					}
				}
			}
			if(deque.isEmpty()) {
				System.out.println(-1);
				return;
			}
		}
		System.out.println(all - count - 1);
	}
}