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 x, y;
  cin >> x >> y;
  int W = -1;
  vector<vector<char>> G(x,vector<char>(y));
  for (auto &v : G) {
    for (auto &c : v) {
      cin >> c;
      if (c == '.') W += 1;
    }
  }
  int dx[4] = {1, 0, -1, 0};
  int dy[4] = {0, 1, 0, -1};
  queue<pair<int,int>> Q;
  vector<vector<int>> dist(x,vector<int>(y,-1));
  dist[0][0] = 0;
  Q.push({0,0});
  while (!Q.empty()) {
    auto p = Q.front();
    Q.pop();
    if (p == make_pair(x-1,y-1)) break;
    for (int i = 0; i < 4; i++) {
      int X = p.first+dx[i];
      int Y = p.second+dy[i];
      if (X < 0 || X >= x || Y < 0 || Y >= y) continue;
      if (G[X][Y] == '#') continue;
      if (dist[X][Y] != -1) continue;
      Q.push({X,Y});
      dist[X][Y] = dist[p.first][p.second] + 1;
    }
  }
  if (dist[x-1][y-1] == -1) cout << -1 << endl;
  else cout << W - dist[x-1][y-1] << endl;
}