#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>   
#include<limits.h>
#include<float.h>
#include<list>
#include <array>
#include <complex>
#include<stdio.h>
#include<string.h>
#include <bitset>

using namespace std;
#define int  long long
 
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(),(x).end()

// int DP[MEM_SIZE][MEM_SIZE] = {0};
// int GMEM[MEM_SIZE][MEM_SIZE] = {0};
template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e <<" ";}
template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;}
template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }
template<class T,class... Ts> void DEBUG(T d, Ts... e){if(DEBUG_OUT == false)return;DEBUG(d);DEBUG(e...);}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

 
//FUNCTION
 
template< typename T >
struct edge {
  int src, to;
  T cost;
 
  edge(int to, T cost) : src(-1), to(to), cost(cost) {}
 
  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
 
  edge &operator=(const int &x) {
    to = x;
    return *this;
  }
 
  operator int() const { return to; }
};
 
template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
template< typename T >
using Matrix = vector< vector< T > >;
 
 
vector<int> dijkstra(WeightedGraph<int> &G,int s)
{ 
  
  vector<int> path(G.size(),I64_MAX);
  path[s] = 0;
  priority_queue <pair<int,int> ,vector<pair<int,int> > ,greater<pair<int,int> > > que;
 
  que.emplace(path[s],s);
 
  while(!que.empty())
  {
    int cost;
    int idx;
    tie(cost,idx) = que.top();
    que.pop();
 
    if(path[idx] < cost) continue;
    for (auto &e: G[idx])
    {
      int next_cost = cost + e.cost;
      if(path[e.to] <= next_cost) continue;
      path[e.to] = next_cost;
      que.emplace(path[e.to],e.to);
    }
  }
 
  return path;
}
 
//SOLVE
void solve(void)
{
  int H,W;
  cin>>H>>W;
  vector<vector<char> > GRID(H,vector<char>(W));
  pair<int,int> START,GOAL;
  int ANS = 0;
  vector<pair<int,int> > vp;
  for (int h = 0; h < H; h++)
  {
    for (int w = 0; w < W; w++)
    {
      cin>>GRID[h][w];
      if(GRID[h][w] == '#')
      {
        vp.emplace_back(h,w);
      }
    }
  }
  START.first = 0;START.second=0;
  GOAL.first = H-1;GOAL.second=W-1;
  int N = H*W;
  // DEBUG(GRID);
  WeightedGraph<int> WG(N);
  for (int i = 0; i < H; i++)
  {
    for (int j = 0; j < W; j++)
    {
      edge<int> e (-1,-1,-1);
      edge<int> re (-1,-1,-1);
      int V = i*W + j;
      int WEIGHT = 0;
      if(i != H-1)
      {
        int nV = V + W;
        WEIGHT = 1;
        e.src = V;
        e.to = nV;
        e.cost = WEIGHT;
        re.src = nV;
        re.to = V;
        re.cost = WEIGHT;
        WG[V].push_back(e);
        WG[nV].push_back(re);
      }
      if(j != W-1)
      {
        int nV = V + 1;
        WEIGHT = 1;
        e.src = V;
        e.to = nV;
        e.cost = WEIGHT;
        re.src = nV;
        re.to = V;
        re.cost = WEIGHT;
        WG[V].push_back(e);
        WG[nV].push_back(re); 
      }
    }
  }
  int FN  = vp[0].first*W + vp[0].second;
  for (int i = 0; i < vp.size()-1; i++)
  {
    int V = vp[i].first*W + vp[i].second;

    // DEBUG(V);
    int nV = vp[i+1].first*W + vp[i+1].second;
    int WEIGHT =0;
    edge<int> e(V,nV,WEIGHT);
    edge<int> re(nV,V,WEIGHT);
    WG[V].push_back(e);
    WG[nV].push_back(re);
  }
  
  vector<int> path = dijkstra(WG,FN);
  int ANS2 = 0;
  for (auto &X : path)
  {
      chmax(ANS2,X);
  }
  cout<<ANS2<<endl;
  
  return;
}


int32_t main(int32_t argc, const char *argv[])
{
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  std::cout << std::fixed;
  std::cout << std::setprecision(9);
  solve();

  return 0;
}


Measured memory_bytes: 276968