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

public class Main {
    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        int h = sc.nextInt();
        int w = sc.nextInt();
        
        char[][] field = new char[h][w];
        int [][] numStep = new int[h][w];
        numStep[0][0] = 1;
        
        int numDot = 0;
        for (int i = 0; i < h; i++) {
            String line = sc.next();
            for (int j = 0; j < w; j++) {
                field[i][j] = line.charAt(j);
                numDot += (line.charAt(j) == '.') ? 1 : 0;
            }
        }
        
        Queue<Integer> qI = new ArrayDeque<>();
        Queue<Integer> qJ = new ArrayDeque<>();
        qI.add(0);
        qJ.add(0);

        int[] moveI = new int[]{1, 0, -1, 0};
        int[] moveJ = new int[]{0, 1, 0, -1};
        
        while (!qI.isEmpty()) {
            int i = qI.poll();
            int j = qJ.poll();
            
            for (int k = 0; k < 4; k++) {
                int nextI = i + moveI[k];
                int nextJ = j + moveJ[k];
                
                if (nextI >= 0 && nextI < h && nextJ >= 0 && nextJ < w &&
                        numStep[nextI][nextJ] == 0 &&
                        field[nextI][nextJ] == '.') {
                    numStep[nextI][nextJ] = numStep[i][j] + 1;
                    qI.add(nextI);
                    qJ.add(nextJ);
                }
            }
        }
        
        if (numStep[h-1][w-1] == 0) {
            System.out.println(-1);
        } else {
            System.out.println(numDot - numStep[h-1][w-1]);
        }
    }
}