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.Scanner;
import java.util.Arrays;
import java.util.Deque;
import java.util.ArrayDeque;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();
        String s[] = new String[H];
        char S[][] = new char[H][W];
        int white = 0;
        boolean check[][] = new boolean[H+2][W+2];
        for (int i = 0; i < H; i++) {
            s[i] = sc.next();
        }
        for (int i = 0; i < H; i++) {
            S[i] = s[i].toCharArray();
        }
        
        for (int i = 1; i <=H; i++) {
            for (int j = 1; j <=W; j++) {
                if (S[i-1][j-1] == '.') {
                    check[i][j] = true;
                    white++;
                }
            }
        }
        boolean dp[][]=new boolean[H+2][W+2];
        dp[1][1]=true;
        for(int t=1;t<H*W;t++){
            boolean next[][]=new boolean[H+2][W+2];
        for(int i=1;i<=H;i++){
            for(int j=1;j<=W;j++){
                next[i][j]=check[i][j]&&(dp[i-1][j]||dp[i][j-1]||dp[i][j+1]||dp[i+1][j]);
            }
        }
        if(next[H][W]==true){
            System.out.println(white-t-1);
            return;
        }
        dp=next;
        }
        System.out.println("-1");

    }
}