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 c,h,w;
int main(){
  cin>>h>>w;
  vector<string> d(h);
  for(int i=0;i<h;i++)cin>>d[i];
  for(int i=0;i<h;i++)
    for(int j=0;j<w;j++)
      if(d[i][j]=='#')
        c++;
  vector<vector<int> > di(h,vector<int>(w,-1));
  queue<pair<int,int> > q;
  di[0][0]=1;
  q.push(make_pair(0,0));
  int dx[4]={0,0,1,-1};
  int dy[4]={1,-1,0,0};
  while(!q.empty()){
    auto v=q.front();
    q.pop();
    for(int i=0;i<4;i++){
      int nx=v.second+dx[i];
      int ny=v.first+dy[i];
      if(nx<0||nx>=w||ny<0||ny>=h)continue;
      if(di[ny][nx]!=-1)continue;
      if(d[ny][nx]=='#')continue;
      di[ny][nx]=di[v.first][v.second]+1;
      q.push(make_pair(ny,nx));
    }
  }
  if(di[h-1][w-1]==-1)
    cout<<"-1";
 else
   cout<<w*h-di[h-1][w-1]-c;
}