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;
#define rep(i,n) for (int i=0; i<(n);++i)
const int INF =1001001001;
using ll=long long;
using P = pair<ll,ll>;
using Graph =vector<string>;

int main() {
int h,w,c;
cin>>h>>w;
Graph g(h);
rep(i,h)cin>>g[i];
rep(i,h)rep(j,w){
  if(g[i][j]=='#')c++;
}
queue<P> q;
vector<vector<int>> dist(h,vector<int>(w,-1)); 
q.push(make_pair(0,0));
int dx[4]={0,0,-1,1};
int dy[4]={1,-1,0,0};
while(!q.empty()){
  P ab=q.front();
  ll x=ab.first;
  ll y=ab.second;
  q.pop();
  rep(i,4){
    int nx=x+dx[i];
    int ny=y+dy[i];
    if(nx<0||ny<0||nx>=h||ny>=w)continue;
    if(g[nx][ny]=='#')continue;
    if(dist[nx][ny]!=-1)continue;
    dist[nx][ny]=dist[x][y]+1;
    q.push(make_pair(nx,ny));
  }
}
if(dist[h-1][w-1]==-1){
  cout<<-1<<endl;
}else{
  cout<<h*w-dist[h-1][w-1]-c-2<<endl;
}
}
