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 <iostream>
#include <queue>
#include <string>
using namespace std;

typedef pair<int,int> P;

int main(void){
    int h,w,d[50][50],dx[]={1,0,-1,0},dy[]={0,1,0,-1},INF,a=0;
    queue<P> q;
    string s[50];
    cin>>h>>w;
    INF = h*w;
    for(int i=0;i<h;i++){
        cin>>s[i];
        for(int j=0;j<w;j++){
            d[i][j]=INF;
            if(s[i][j]=='.')a++;
        }
    }
    
    q.push(P(0,0));
    d[0][0]=1;
    while(q.size()){
        P p=q.front();
        q.pop();
        for(int i=0;i<4;i++){
            int ny=p.first+dy[i],nx=p.second+dx[i];
            if(ny>=0&&ny<h&&nx>=0&&nx<w){
                if(s[ny][nx]=='.'&&d[ny][nx]==INF){
                    q.push(P(ny,nx));
                    d[ny][nx]=d[p.first][p.second]+1;
                }
            }
        }
    }
    if(d[h-1][w-1]==INF){
        cout<<-1<<endl;
    }else{
        cout<<a-d[h-1][w-1]<<endl;
    }
}
