#include <iostream>
#include <queue>
#include <cstdio>
#include <cstring>
using namespace std;

int n, m;
char a[55][55];
int nextn[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int dis[55][55], vst[55][55];

struct Node {
    int x, y;
};

int main() {
    cin >> n >> m;
    
    memset(a, 0, sizeof(a));
    memset(dis, 0, sizeof(dis));
    memset(vst, 0, sizeof(vst));
    
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> a[i][j];
        }
    }
    
    queue<Node> que1; // 向前搜 
    queue<Node> que2; // 向后搜 
    
    // vst标记状态 dis表示路程 
    que1.push(Node{1, 1}), dis[1][1] = 1, vst[1][1] = 1;
    que2.push(Node{n, m}), dis[n][m] = 1, vst[n][m] = 2;
    
    while (!que1.empty() && !que2.empty()) {
        int flag; 
        Node head;
        if (que1.size() > que2.size()) { // 哪个队列元素少就从哪个队列开始搜 
            head = que2.front(); // 向前搜
            que2.pop();
            flag = 2;
        } else {
            head = que1.front(); // 向后搜
            que1.pop();
            flag = 1;
        }
        
        for (int i = 0; i < 4; i++) {
            
            int tx = head.x + nextn[i][0];
            int ty = head.y + nextn[i][1];
            
            if (tx > n || ty > m || tx <= 0 || ty <= 0) continue;
            
            if (a[tx][ty] == '.') {
                if (!dis[tx][ty]) { // 这一步没有队列走过
                    dis[tx][ty] = dis[head.x][head.y] + 1; // 路程加一 
                    vst[tx][ty] = vst[head.x][head.y]; // 继承状态 
                    if (flag == 1) que1.push(Node{tx, ty}); 
                    else if (flag == 2) que2.push(Node{tx, ty});
                } else if (vst[head.x][head.y] + vst[tx][ty] == 3) { // 如果相遇 
                    cout << dis[head.x][head.y] + dis[tx][ty] << endl; // 步数相加 
                    return 0;
                }
            }
        }
    }

    return 0;
}