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;
  string s[50];
  cin>> H>> W;
  for(int i=0;i<H;i++)cin>> s[i];
  
  int ret=H*W;
  int far[50][50];
  for(int i=0;i<H;i++)for(int j=0;j<W;j++)far[i][j]=-1;
  int mx[4]={0,0,-1,+1};
  int my[4]={-1,1,0,0};
  queue<pair<int,int>> que;
  que.push(pair<int,int>(0,0));
  far[0][0]=0;
  while(que.size())
  {
    pair<int,int> p=que.front();que.pop();
    for(int i=0;i<4;i++)
    {
      int x=p.first+mx[i];
      int y=p.second+my[i];
      if(x>=0&&x<H&&y>=0&&y<W&&s[x][y]!='#'&&far[x][y]==-1)
      {
        far[x][y]=far[p.first][p.second]+1;
        que.push(pair<int,int>(x,y));
      }
    }
  }
  int black=0;
  for(int i=0;i<H;i++)for(int j=0;j<W;j++)if(s[i][j]=='#')black++;
  ret-=black+far[H-1][W-1]+1;
  if(far[H-1][W-1]==-1)ret=-1;
  cout<< ret<< endl;
  return 0;
}
