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<bits/stdc++.h>
using namespace std;
int main(){
  int h,w;
  cin>>h>>w;
  vector<string> s(h);
  for(int i=0;i<h;i++)
    cin>>s.at(i);
  vector<int> dy={-1,1,0,0};
  vector<int> dx={0,0,-1,1};
  vector<vector<int>> d(h,vector<int>(w,h*w));
  d.at(0).at(0)=1;
  queue<vector<int>> q;
  q.push({0,0,1});
  while(!q.empty()){
    auto a=q.front();
    q.pop();
    int y=a.at(0);
    int x=a.at(1);
    int dxy=a.at(2);
    for(int m=0;m<4;m++){
      int my=y+dy.at(m);
      int mx=x+dx.at(m);
      if(0<=my&&my<h&&0<=mx&&mx<w&&d.at(my).at(mx)==h*w&&s.at(my).at(mx)=='.'){
        d.at(my).at(mx)=dxy+1;
        q.push({my,mx,dxy+1});
      }
    }
  }
  int v=0;
  for(int i=0;i<h;i++)
    for(int j=0;j<w;j++)
      v+=(s.at(i).at(j)=='.'?1:0);
  cout<<max(v-d.at(h-1).at(w-1),-1)<<endl;
}