#include <bits/stdc++.h>
#define rep(i,n) for (int i = (0); i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(),(x).end()
#define rrng(x) (x).rbegin(),(x).rend()
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define show(x) cout << #x << " = " << (x) << endl
#define show2(x,y) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << endl
#define show3(x,y,z) cout << #x << " = " << (x) << ", " << #y << " = " << (y) <<  ", " << #z << " = " << (z) << endl
#define showv(v) rep(i,v.size()) printf("%d%c", v[i], i==v.size()-1?'\n':' ')
#define showv2(v) rep(j,v.size()) showv(v[j])
#define showt(t,n) rep(i,n) printf("%d%c", t[i], i==n-1?'\n':' ')
#define showt2(t,r,c) rep(j,r) showt(t[j],c)
#define showvp(p) rep(i,p.size()) printf("%d %d\n", p[i].first, p[i].second);
#define printv(v) rep(i,v.size()) printf("%d\n", v[i])
#define printt(t,n) rep(i,n) printf("%d\n", t[i])
#define incl(v,x) find(rng(v),x)!=v.end()
#define incls(s,c) s.find(c)!=string::npos
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define bit(n,k) ((n>>k)&1) // nのk bit目
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define uni(x) x.erase(unique(rng(x)),x.end())
#define SP << " " <<
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<P> vp;
typedef vector<T> vt;
const int mod = 1000000007;
const double EPS = 1e-9;
const int INF = (1<<30)-1;
const ll INFLL = (1LL<<62)-1;
#define dame { puts("No"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

const int dx[4] = {1, 0,-1, 0};
const int dy[4] = {0, 1, 0,-1};

int main () {
  int h, w;
  cin >> h >> w;
  vs s(h);
  rep(i,h) cin >> s[i];

  vvi d(h,vi(w,INF));
  d[0][0] = 0;
  vv(P) prev(h,v(P)(w,P(-1,-1)));
  int sy = 0, sx = 0, gy = h-1, gx = w-1;
  queue<P> q;
  q.push(P(sy,sx));
  while(!q.empty()) {
    P p = q.front(); q.pop();
    int y = p.fi, x = p.se;
    if (y == gy && x == gx) break;
    rep(i,4) {
      int ny = y + dy[i];
      int nx = x + dx[i];
      if (!(isin(ny,0,h) && isin(nx,0,w))) continue;
      if (s[ny][nx] == '#') continue;
      if (d[ny][nx] != INF) continue;
      d[ny][nx] = d[y][x] + 1;
      prev[ny][nx] = P(y,x);
      q.push(P(ny,nx));
    }
  }

  if (d[gy][gx] == INF) {
    cout << -1 << endl;
    return 0;
  }

  for (P t = P(gy, gx); t != P(-1,-1); t = prev[t.fi][t.se]) {
    s[t.fi][t.se] = '#';
  }
  //s[sy][sx] = '#';

  int ans = 0;
  rep(i,h)rep(j,w) {
    if (i == sy && j == sx) continue;
    if (i == gy && j == gx) continue;
    if (s[i][j] == '.') ans++;
  }

  cout << ans << endl;
  return 0;
}

Measured memory_bytes: 256