#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
//#include <boost/foreach.hpp>
//#include <boost/range/algorithm.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define ll long long
#define Sort(v) sort(all(v))
//#define INF 1e9
#define LINF (1LL<<40)
#define END return 0
#define pb push_back
#define se second
#define fi first
#define pb push_back
#define all(v) (v).begin() , (v).end()
#define MP make_pair
#define int long long
#define umap unordered_map 
#define re0 return 0
using namespace std;
int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};
 int dx[]={0,1,0,-1};
 int dy[]={1,0,-1,0};
//typedef pair<int,int> P;

const long long MOD=1000000007LL;
bool isupper(char c){if('A'<=c&&c<='Z')return 1;return 0;}
bool islower(char c){if('a'<=c&&c<='z')return 1;return 0;}
bool iskaibun(string s){for(int i=0;i<s.size()/2;i++)if(s[i]!=s[s.size()-i-1])return 0;return 1;}
bool isnumber(char c){return ('0'<=c&&c<='9');}
bool isalpha(char c){return (isupper(c)||islower(c));}

template<typename T> 
void print(vector<T> v){
    for(int i=0;i<v.size();i++){
        if(i)cout<<" ";
        cout<<v[i];
    }
    cout<<endl;
}
int INF=1e18;

template<typename T>
void printendl(vector<T> v){
    for(auto date:v)cout<<date<<endl;
}

template<typename T>
void printvv(vector<vector<T>> v){
    for(int i=0;i<v.size();i++){
        for(int j=0;j<v[i].size();j++){
            if(j)cout<<" ";
            cout<<v[i][j];
        }
        cout<<endl;
    }
}
struct Point{
    int x,y,num;

    double e_dis(Point other){
        return sqrt((x-other.x)*(x-other.x)+(y-other.y)*(y-other.y));
    }
};

int gcd(int a,int b){
    if(b==0)return a;
    else return gcd(b,a%b);
}

bool isPrime(int x){
  if(x==1)return 0;
  if(x==2)return 1;
  if(x%2==0)return 0;
  for(int i=3;i*i<=x;i++)if(x%i==0)return 0;
  return 1;
}

int d(int x){
    int ret=0;
    while(x>0){
        ret++;
        x/=10;
    }
    return ret;
}

void dfs(vector<int>& ans, vector<vector<int>>& v, int max_edge, int parent, int idx){
    //cout<<parent<<idx<<endl;
    int color_idx=1;
    rep(i,0,v[idx].size()){
        if(v[idx][i]==parent)continue;
        while(color_idx==ans[idx])color_idx++;
        ans[v[idx][i]]=color_idx;
        dfs(ans,v,max_edge,idx,v[idx][i]);
        color_idx++;
    }
    return;
}

vector<Point> bfspoint(int x,int y,vector<string>& v,int h,int w){
    queue<Point> que;
    Point init={x,y,0};
    que.push(init);
    vector<vector<int>> visited(h,vector<int>(w,-1));
    visited[init.y][init.x]=0;
    while(!que.empty()){
        Point now=que.front();
        que.pop();
        rep(i,0,4){
            int nx = dx[i]+now.x;
            int ny = dy[i]+now.y;
            if(0<=nx&&0<=ny&&nx<w&&ny<h&&v[ny][nx]!='#'&&visited[ny][nx]==-1){
                Point next = {nx,ny,now.num+1};
                que.push(next);
                visited[ny][nx]=now.num+1;
            }
        }
    }
    int ma=-1;
    vector<Point> ret;
    rep(i,0,h){
        rep(j,0,w){
            ma=max(ma,visited[i][j]);
        }
    }

    rep(i,0,h){
        rep(j,0,w){
            if(ma==visited[i][j]){
                ret.push_back(Point{j,i});
            }
        }
    }
    return ret;
}

int bfsint(int x,int y,vector<string>& v,int h,int w){
    queue<Point> que;
    Point init={x,y,0};
    que.push(init);
    vector<vector<int>> visited(h,vector<int>(w,-1));
    visited[init.y][init.x]=0;
    while(!que.empty()){
        Point now=que.front();
        que.pop();
        rep(i,0,4){
            int nx = dx[i]+now.x;
            int ny = dy[i]+now.y;
            if(0<=nx&&0<=ny&&nx<w&&ny<h&&v[ny][nx]!='#'&&visited[ny][nx]==-1){
                Point next = {nx,ny,now.num+1};
                que.push(next);
                visited[ny][nx]=now.num+1;
            }
        }
    }
    int ret=-1;
    rep(i,0,h){
        rep(j,0,w){
            ret=max(ret,visited[i][j]);
        }
    }
    //printvv(visited);
    return ret;
}


signed main(){
    int h,w;
    cin>>h>>w;
    vector<string> v(h);
    rep(i,0,h)cin>>v[i];
    int ans=0;
    rep(i,0,h){
        rep(j,0,w){
            if(v[i][j]=='.'){
                ans=max(ans,bfsint(j,i,v,h,w));
            }
        }
    }
    cout<<ans<<endl;
    
}

/*
20 20
....................
....................
....................
....................
....................
....................
....................
....................
....................
....................
....................
....................
....................
....................
....................
....................
....................
....................
....................
....................
*/

Measured memory_bytes: 384