Problem: 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

Solution (in CPP):

Solution:
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define INF 1000000000
typedef pair<int,int>P;
int dx[]={0,1,0,-1};
int dy[]={-1,0,1,0};
char mp[109][109];
int d[109][109];

int main(){
  int h,w;
  int ans=0;
  cin>>h>>w;
  for(int i=0;i<h;i++){
    for(int j=0;j<w;j++){
      cin>>mp[i][j];
      if(mp[i][j]=='.')ans++;
      d[i][j]=INF;
    }
  }

  queue<P>que;
  que.push(P(0,0));
  d[0][0]=0;
  while(!que.empty()){
    P now=que.front();que.pop();
    int x=now.fi;
    int y=now.se;
    for(int i=0;i<4;i++){
      int nx=x+dx[i];
      int ny=y+dy[i];
      if(0<=nx&&nx<w&&0<=ny&&ny<h&&mp[ny][nx]!='#'&&d[ny][nx]==INF){
	que.push(P(nx,ny));
	d[ny][nx]=d[y][x]+1;
      }
    }
  }

  if(d[h-1][w-1]==INF){
    cout<<-1<<endl;
  }
  else{
    cout<<ans-d[h-1][w-1]-1<<endl;
  }
  return(0);
}