#include <bits/stdc++.h>

using namespace std;

#define ALL(x) (x).begin(), (x).end()
#define DUMP(xs) for (auto x:xs) cout<<x<<' ';cout<<endl
#define DUMPP(xs) for (auto x:xs) cout<<'('<<x.first<<','<<x.second<<')'<<' ';cout<<endl
#define FOR(i,a,b) for (ll i=(ll)(a);i<(ll)(b);++i)
#define OUT(x) cout<<x<<endl
#define OUTP(x) cout<<'('<<x.first<<','<<x.second<<')'<<endl;
#define REP(i,n) FOR(i,0,n)
#define YES(cond) cond ? OUT("YES") : OUT("NO")
#define Yes(cond) cond ? OUT("Yes") : OUT("No")

template<class T> T gcd(const T x,const T y){if(!y){return x;}return gcd(y,x%y);}
template<class T> T lcm(const T x,const T y){return x/gcd(x,y)*y;};
template<class T> T modpow(T x,T n,const T mod) {
  T res=1;while(n>0){if(n%2)res=res*x%mod;x=x*x%mod;n/=2;};return res;
}
template<class T> T modinv(T x,const T mod){return modpow(x,mod-2,mod);}
template<class T> bool alltrue(const T &a){return all_of(ALL(a),[](bool x){return x;});}
template<class T> bool anytrue(const T &a){return any_of(ALL(a),[](bool x){return x;});}
template<class T> bool contain(const T &a,const T &b){for(auto x:b){if (a.find(x)==a.end()){return false;}}return true;}
template<class T> bool mmax(T &m,const T q){ if (m < q) {m = q; return true;} else return false; }
template<class T> bool mmin(T &m,const T q){ if (m > q) {m = q; return true;} else return false; }
template<class T> int siz(const T &a) {return (int)a.size();}
template<class T> set<T> devisers(T n) {
  set<T> res;for(T i=1;i<(T)sqrt(n)+1;i++){if(n%i==0){res.insert(i);res.insert(n/i);}}return res;
}
template<class T> void concat(T &a, const T &b){a.insert(a.end(),ALL(b));}
template<class T> void getand(const T &a,const T &b,T &c) {
  set_intersection(ALL(a),ALL(b),inserter(c,c.end()));
}
template<class T> void getor(const T &a,const T &b,T &c) {
  set_union(ALL(a),ALL(b),inserter(c,c.end()));
}
template<class T> void getdiff(const T &a,const T &b,T &c) {
  set_difference(ALL(a),ALL(b),inserter(c,c.end()));
}
template<class T> T deg2rad(T deg) {return deg*2*M_PI/360;}
template<class T> T rad2deg(T rad) {return rad*360/(2*M_PI);}

typedef long long ll;
typedef pair<ll, ll> P;

const ll MOD=1e9+7;
const ll MAX=5e6;

vector<int> bellman_ford(int V, int s, vector<vector<int>> &G) {
  vector<int> d(V,INT_MAX);d[s]=0;
  REP(i,V-1) {
    REP(v,V) {
      if (d[v]==INT_MAX) continue;
      for (int nv:G[v]) {
        mmin(d[nv],d[v]+1);
      }
    }
  }
  return d;
}

int main() {
  int H,W;cin>>H>>W;
  vector<string> maze(H);
  REP(i,H) {
    cin>>maze[i];
  }
  int N = H*W;

  auto converter = [&](int h, int w) { return h*W + w; };
  vector<vector<int>> G(N);

  vector<P> walks{{0,1},{1,0}};
  REP(h,H)REP(w,W) {
    if (maze[h][w]=='#') continue;
    int curP = converter(h,w);
    for (P walk:walks) {
      int nextH = h+walk.first;
      int nextW = w+walk.second;
      int nxtP = converter(nextH,nextW);
      if (nextH<H && nextW<W && maze[nextH][nextW]=='.') {
        G[curP].push_back(nxtP);
        G[nxtP].push_back(curP);
      }
    }
  }

  int ans = 0;
  REP(i,N) {
    vector<int> lis = bellman_ford(N,i,G);
    vector<int> filtered;
    copy_if(ALL(lis), back_inserter(filtered), [](int a){ return a < INT_MAX;});
    mmax(ans, *max_element(ALL(filtered)));
  }
  OUT(ans);

  return 0;
}

Measured memory_bytes: 256