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;
  char s[h][w];
  vector<vector<int>> cost(h,vector<int>(w,-1));
  cost[0][0]=0;
  int black = 0;
  for (int i = 0; i < h; i++)
  {
    for (int j = 0; j < w; j++)
    {
      cin >> s[i][j];
      if(s[i][j]=='#') black++;
    }
  }

  queue<pair<int,int>> que;
  que.emplace(0,0);
  while(!que.empty()){
    int dx[4] = {0,0,1,-1};
    int dy[4] = {1,-1,0,0};
    pair<int,int> p=que.front();
    que.pop();
    for (int i = 0; i < 4; i++)
    {
      int nx = p.first + dx[i];
      int ny = p.second + dy[i];
      if(nx>=0 && nx<h && ny>=0 && ny<w && s[nx][ny]=='.' && cost[nx][ny]==-1){
        cost[nx][ny]=cost[p.first][p.second]+1;
        que.emplace(nx,ny);
      }
    }
  }
  if(cost[h-1][w-1]==-1) cout << -1 << endl;
  else cout << h*w-black-cost[h-1][w-1]-1 << endl;  
}