#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <iomanip>
#include <set>
#include <unordered_map>

#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

using namespace std;

#define rep(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define reps(i,n) for(int i=1,i##_len=(n);i<=i##_len;++i)
#define rrep(i,n) for(int i=((int)((n)-1));i>=0;--i)
#define rreps(i,n) for(int i=((int)(n));i>0;--i)
#define rept(n) for(int ______i=((int)(n));______i>0;--______i)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define ZERO(a) memset(a,0,sizeof(a))
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(),v.end()),v.end());

// vector
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &x : vec) is >> x;
    return is;
}
// pair
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
// vector
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
    os << "{";
    for (int i = 0; i < vec.size(); i++) {
        os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}
// map
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
    os << "{";
    repi(itr, map_var) {
        os << *itr;
        itr++;
        if (itr != map_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
// set
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
    os << "{";
    repi(itr, set_var) {
        os << *itr;
        itr++;
        if (itr != set_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
#define DUMPOUT cout
void dump_func() {
    DUMPOUT << endl;
}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) {
        DUMPOUT << ", ";
    }
    dump_func(std::move(tail)...);
}
#ifdef LOCAL_
#define dump(...)                                                              \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                            \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]"        \
            << endl                                                            \
            << "    ",                                                         \
        dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif

typedef long long int lli;
typedef pair<int, int> ii;
typedef priority_queue<int, vector<int>, greater<int> > heapq;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
struct aaa{
    aaa(){
        cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);
    };
}aaaaaaa;

inline int eHash(int y, int x, int cnt) {
    return cnt * 3600 + y * 60 + x;
}

inline void dHash(int hash, int &y, int &x, int &cnt) {
    cnt = hash / 3600;
    y = (hash % 3600) / 60;
    x = (hash % 3600) % 60;
}
// #define int long long int
signed main() {
    int H, W; cin >> H >> W;
    char stage[59][59];
    int white = 0;
    reps(i, H) {
        reps(j, W) {
            cin >> stage[i][j];
            if (stage[i][j] == '.') white++;
        }
    }
    rep(i, W + 2) {
        stage[0][i] = '#';
        stage[H + 1][i] = '#';
    }
    rep(i, H + 2) {
        stage[i][0] = '#';
        stage[i][W + 1] = '#';
    }

    // struct Solve{
    //     int y, x;
    //     int cnt;
    //     Solve(int a, int b, int c): y(a), x(b), cnt(c){}
    // } start(1, 1, 1);
    queue<int> Q;
    Q.push(eHash(1, 1, 1));
    while (!Q.empty()) {
        int hash = Q.front(); Q.pop();
        int sy, sx, scnt; dHash(hash, sy, sx, scnt);

        if (sy == H && sx == W) {
            cout << white - scnt << endl;
            return 0;
        }
        rep(i, 4) {
            int y = sy + dy[i];
            int x = sx + dx[i];

            if (stage[y][x] != '#' && scnt <= white) {
                stage[y][x] = '#';
                Q.push(eHash(y, x, scnt + 1));
            }
        }
    }

    cout << -1 << endl;
}


Measured memory_bytes: 504