#include <bits/stdc++.h>
using namespace std;
#define INF 1<<30
#define endl '\n'
#define maxn 1000005
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
const double PI = acos(-1.0);
const ll mod = 1e9 + 7;

inline void normal(ll &a) { a %= mod; (a < 0) && (a += mod); }
inline ll modMul(ll a, ll b) { a %= mod, b %= mod; normal(a), normal(b); return (a * b) % mod; }
inline ll modAdd(ll a, ll b) { a %= mod, b %= mod; normal(a), normal(b); return (a + b) % mod; }
inline ll modSub(ll a, ll b) { a %= mod, b %= mod; normal(a), normal(b); a -= b; normal(a); return a; }
inline ll modPow(ll b, ll p) { ll r = 1; while (p) { if (p & 1) r = modMul(r, b); b = modMul(b, b); p >>= 1; } return r; }
inline ll modInverse(ll a) { return modPow(a, mod - 2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }


///**
template < typename F, typename S >
ostream& operator << ( ostream& os, const pair< F, S > & p ) {
  return os << "(" << p.first << ", " << p.second << ")";
}

template < typename T >
ostream &operator << ( ostream & os, const vector< T > &v ) {
  os << "{";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if ( it != v.begin() ) os << ", ";
    os << *it;
  }
  return os << "}";
}

template < typename T >
ostream &operator << ( ostream & os, const set< T > &v ) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if ( it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}

template < typename F, typename S >
ostream &operator << ( ostream & os, const map< F, S > &v ) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if ( it != v.begin() ) os << ", ";
    os << it -> first << " = " << it -> second ;
  }
  return os << "]";
}

#define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0)

clock_t tStart = clock();
#define timeStamp dbg("Execution Time: ", (double)(clock() - tStart)/CLOCKS_PER_SEC)

void faltu () { cerr << endl; }

template <typename T>
void faltu( T a[], int n ) {
  for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
  cerr << endl;
}

template <typename T, typename ... hello>
void faltu( T arg, const hello &... rest) { cerr << arg << ' '; faltu(rest...); }
// Program showing a policy-based data structure.
#include <ext/pb_ds/assoc_container.hpp> // Common file 
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less 
#include <iostream>
using namespace __gnu_pbds;
using namespace std;
// GNU link : https://goo.gl/WVDL6g
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
        tree_order_statistics_node_update>
        new_data_set;

// find_by_order(k) – ফাংশনটি kth ordered element এর একটা পয়েন্টার রিটার্ন করে। অর্থাৎ তুমি চাইলেই kth ইন্ডেক্সে কি আছে, সেটা জেনে ফেলতে পারছো!
// order_of_key(x) – ফাংশনটি x এলিমেন্টটা কোন পজিশনে আছে সেটা বলে দেয়।

//*//**___________________________________________________**/

const int N = 30;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int n, m;
char grid[N][N];
bool vis[N][N], vis2[N][N];
int dist[N][N], dist2[N][N];
bool is_valid(int x, int y)
{
  return (x >= 1 && x <= n && y >= 1 && y <= m);
}

void bfs(int x, int y)
{
// dbg(x, y);
  queue<pair<int, int> > Q;
  Q.push({x, y});
  vis[x][y] = true;
  dist[x][y] = 0;
  while (!Q.empty()) {
    x = Q.front().first;
    y = Q.front().second;
    Q.pop();
    for (int i = 0; i < 4; i++) {
      int r = dx[i] + x;
      int c = dy[i] + y;
      if (is_valid(r, c)) {
        if (vis[r][c] || grid[r][c] == '#')continue;
        //dbg(r, c);
        vis[r][c] = true;
        //dbg(vis[r][c], r, c);
        Q.push({r, c});
        dist[r][c] = dist[x][y] + 1;
      }
    }
  }
// dbg(654564);
}

void bfs2(int x, int y)
{
  queue<pair<int, int> > Q;
  Q.push({x, y});
  vis2[x][y] = true;
  dist2[x][y] = 0;
  while (!Q.empty()) {
    x = Q.front().first;
    y = Q.front().second;
    Q.pop();
    for (int i = 0; i < 4; i++) {
      int r = dx[i] + x;
      int c = dy[i] + y;
      if (is_valid(r, c)) {
        if (vis2[r][c] || grid[r][c] == '#')continue;
        // dbg(r, c);
        vis2[r][c] = true;
        Q.push({r, c});
        dist2[r][c] = dist2[x][y] + 1;
      }
    }
  }
}


int main()
{
  FASTIO
  /*
#ifndef ONLINE_JUDGE
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
  freopen("error.txt", "w", stderr);
#endif
//*/
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      cin >> grid[i][j];
    }
  }

  // dbg(n, m);
  // for (int l = 1; l <= n; l++) {
  //   for (int r = 1; r <= m; r++) {
  //     cerr << grid[l][r] << " ";
  //   }
  //   cerr << endl;
  // }

  memset(dist, 0, sizeof dist);
  memset(vis, false, sizeof vis);
  memset(vis2, false, sizeof vis2);
  memset(dist2, 0, sizeof dist2);

  int ans = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (vis[i][j] == false && grid[i][j] == '.') {
        //dbg(i, j);
        bfs(i, j);
      }
      //dbg(54554);
      int x = -1, y = -1;
      int mx = 0;
      for (int l = 1; l <= n; l++) {
        for (int r = 1; r <= m; r++) {
          if (dist[l][r] > mx) {
            // dbg(l,r);
            x = l;
            y = r;
            mx = dist[l][r];
          }
        }
      }
      // dbg(x, y);
      if (x != -1 && y != -1) {
        //dbg(x, y);
        bfs2(x, y);
      }

      for (int l = 1; l <= n; l++) {
        for (int r = 1; r <= m; r++) {
          if (dist2[l][r] > ans) {
            ans = dist2[l][r];
          }
        }
      }

      // for (int l = 1; l <= n; l++) {
      //   for (int r = 1; r <= m; r++) {
      //     cerr << vis[l][r] << " ";
      //   }
      //   cerr << endl;
      // }
    }
  }
  cout << ans << endl;
}