#include <sstream>
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<ctime>
#include<cmath>
#include<map>
#include<unordered_map>
#include<stack>
#include<random>
#include<queue>
#include<list>
#include<math.h>
#include<bitset>
#include<fstream>
using namespace std;
#define ll long long int
#define ld long double
#define key pair<ld,ld>
#define ii pair<int,int>
#define si set<int>
#define vii vector<pair<int,int> >
#define vi vector<int>
#define vll vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int> >
#define vs vector<string>
#define all(v) v.begin(),v.end()
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define nu 100001
#define mul(x,y) ((ll)(x)*(y))%mod
#define tr(c,i) for(auto i = (c).begin(); i != (c).end(); i++)
#define fastio  ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define forn(i, n) for (int i = 0; i < int(n); i++)
const ll INF=9223372036854775807;
const ll mod=998244353;
int  MOD(int  a, int  b)
{
    if(a>b)
        return a-b;
    else
        return b-a;
}
ll  max3(ll  a,ll  b, ll  c)
{
    return max(c,max(a,b));
}
ll min3(ll  a,ll  b,ll  c)
{
    return min(a,min(b,c));
}
ll  power(ll  x,ll  y,ll mod1)
{
    ll res = 1;
    while (y > 0)
    {
        if (y & 1)
            res = (res*x)%mod1;
        y = y>>1;
        x = (x*x)%mod1;
    }
    return res;
}
ll logg(ll  a)
{
    ll  x=0;
    while(a>1)
    {
        x++;
        a/=2;
    }
    return x;
}
ll  gcd(ll  a,ll   b)
{
    if (a == 0)
        return b;
    return gcd(b % a, a);
}
ll abso(ll x)
{
    if(x<0)
    {
        return -x;
    }
    return x;
}
ll ceiling (ll  a,ll  b)
{
    if(a%b==0)
    {
        return a/b;
    }
    else
    {
        return a/b+1;
    }
}
ll modinv(ll x,ll p)
{
    return power(x,p-2,p);
}
struct point
{
    ll x;ll y;
};
ll cross(point a,point b)
{
    return a.x*b.y-b.x*a.y;
}
bool ccw(point p1,point p2)
{
    /* point n1;n1.x=p1.x-p0.x;n1.y=p1.y-p0.y;
     point n2;n2.x=p2.x-p0.x;n2.y=p2.y-p0.y;*/
    if(cross(p1,p2)>0)
    {
        return true;
    }
    else
    {
        return false;
        //No need to worry about cross=0 case in this question;
    }
}
void ccw_sort(vector<point> &v)
{
    vector<point> v1,v2;
    for(int i=0;i<v.size();i++)
    {
        if(v[i].y>0)
        {
            v1.push_back(v[i]);
        }
        else
        {
            v2.push_back(v[i]);
        }
    }
    sort(all(v1),ccw);
    sort(all(v2),ccw);
    for(int i=0;i<v2.size();i++)
    {
        v1.push_back(v2[i]);
    }
    v=v1;
}
vvi adj;
vvi grid;
bool valid(int x,int y,int h,int w)
{
    if(x<h&&y<w&&x>=0&&y>=0&&grid[x][y]!=-1)
    {
        return true;
    }
    return false;
}
int bfs(int x,int y,int h,int w)
{
    vi vis(h*w);vi dist(h*w);
    queue<int> q;q.push(x+y*h);
    vis[x+y*h]=1;int mx=0;
    while(!q.empty())
    {
        auto cur=q.front();q.pop();mx=max(mx,dist[cur]);
        for(int j=0;j<adj[cur].size();j++)
        {
            if(!vis[adj[cur][j]])
            {
                q.push(adj[cur][j]);
                vis[adj[cur][j]]=1;
                dist[adj[cur][j]]=1+dist[cur];
            }
        }
    }
    return mx;
}
int main()
{
    fastio;
    int h,w;
    cin>>h>>w;
    adj.resize(h*w);
    grid.resize(h);
    for(int i=0;i<h;i++)
    {
        grid[i].resize(w);
        for(int j=0;j<w;j++)
        {
            char x;
            cin>>x;
            if(x=='#')
            {
                grid[i][j]=-1;
            }
            else
            {
                grid[i][j]=1;
            }
        }
    }
    for(int i=0;i<h;i++)
    {
        for(int j=0;j<w;j++)
        {
            if(grid[i][j]!=-1)
            {
                for(int k=i-1;k<=i+1;k+=2)
                {
                
                        if(valid(k,j,h,w))
                        {
                            adj[i+j*h].push_back(k+j*h);
                        }
                }
                for(int k=j-1;k<=j+1;k+=2)
                {
                    
                    if(valid(i,k,h,w))
                    {
                        adj[i+j*h].push_back(i+k*h);
                    }
                }
            }
        }
    }
    int ans=0;
    for(int i=0;i<h;i++)
    {
        for(int j=0;j<w;j++)
        {
            if(grid[i][j]!=-1){
            ans=max(ans,bfs(i,j,h,w));
            }
        }
    }
    cout<<ans<<endl;
}


Measured memory_bytes: 256