#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <utility>
#include <numeric>
#include <deque>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <limits>
#include <cassert>
#include <bitset>
#include <list>

#define for0(i, N)    for (int i = 0  ; i <  (N); ++i)
#define for1n(i, N)   for (int i = 1  ; i <= (N); ++i)
#define for1(i, N)    for (int i = 1  ; i <  (N); ++i)
#define forn(i, N)    for (int i = 0  ; i <= (N); ++i)
#define forx(i, N, x) for (int i = (x); i <  (N); ++i)
#define forl(i, N, x, a) for (int i = (x), a = 0; a < (N);  \
                              i = (i + 1) % (N), ++a)

template<size_t i>
std::bitset<i> operator++(std::bitset<i> b, int){
    static_assert(i <= 64, "Cannot cast 64bit int.");
    return b = (unsigned long long)b + 1;
}

template<size_t i>
std::bitset<i> operator++(std::bitset<i> b){
    static_assert(i <= 64, "Cannot cast 64bit int.");
    auto temp = b;
    b++;
    return temp;
}

template<size_t i>
std::bitset<i> operator--(std::bitset<i> b, int){
    static_assert(i <= 64, "Cannot cast 64bit int.");
    return b = (unsigned long long)b - 1;
}

template<size_t i>
std::bitset<i> operator--(std::bitset<i> b){
    static_assert(i <= 64, "Cannot cast 64bit int.");
    auto temp = b;
    b--;
    return temp;
}

using namespace std;

typedef long long ll;
typedef long double ld;
typedef priority_queue<ll> pq;
typedef priority_queue<ll,vector<ll>, greater<ll>> pql;
typedef stack<ll> stk;
typedef queue<ll> qu;
typedef pair<ll, ll> pll;
typedef map<ll, ll> mll;
typedef unordered_map<ll, ll> umll;
typedef set<ll> sll;
typedef unordered_set<ll> usll;
typedef vector<ll> vll;
typedef vector<ld> vld;


struct arc{
    int to;
    int cost;
};

template<typename T>
struct node{
    T value;
    vector<arc> arcs;
    node(T v) : value(v){}

    node& operator= (T const& a){
        value = a;
        return *this;
    }
    operator T() const {
        return value;
    }

};

template<typename T>
class graph{
protected:
    vector<node<T>> nodes;
    T init;
    int n;
public:

    graph(int N, T value) : nodes(N, value), init(value), n(N){};

    void addArc(int from, int to, int cost){
        assert(0 <= from && from <= n - 1 && 0 <= to && to <= n - 1);
        nodes[from].arcs.push_back({to,cost});
    }
    void addEdge(int a, int b, int cost){
        addArc(a, b, cost);
        addArc(b, a, cost);
    }
    node<T>& operator[](int index) {
        return nodes[index];
    }

    auto begin() { return nodes.begin(); }
    auto end()   { return nodes.end();   }

    auto const& getInstance(){
        return nodes;
    }

    void reset(T init){
        for(auto &x : nodes){
            x.value = init;
        }
    }

    void reset(void){
        reset(init);
    }

};

class bellmanford : public graph<int>{
    int N;
    int changed;

    void r(unordered_set<int> froms, int termination){
        bool c = false;
        unordered_set<int> f;
        for (auto& from : froms){
            for (auto& i : nodes[from].arcs) {
                if (nodes[i.to].value > i.cost + nodes[from].value) {
                    nodes[i.to].value = i.cost + nodes[from].value;
                    f.insert(i.to);
                    c = true;
                }
            }
        }
        // Terminated
        if (!c) return;

        // Negative loop?
        if(!termination){
            changed = c;
            return;
        }
        // continue
        r(move(f), termination-1);
    }

public:

    bellmanford(int N): graph::graph(N, std::numeric_limits<int>::max()),
                        N(N), changed(false){}

    bool run(int start){
        nodes[start].value = 0;
        r({start}, N-1);
        return changed;
    }

    int const& operator[] (int index){
        return nodes[index].value;
    }

};

struct warshallFloyd : public graph<ll>{
    static constexpr auto INF = std::numeric_limits<ll>::max();
    warshallFloyd(int n) : graph<ll>(n + 1, 0){}

    auto run(void){
        std::vector<std::vector<ll>> K(n, std::vector<ll>(n, INF));

        for (int i = 0; i < n; ++i) {
            auto const &arcs = getInstance()[i].arcs;
            for(auto &x : arcs){
                K[i][x.to] = min<ll>(K[i][x.to], x.cost);
            }
        }

        for (int k = 0; k < n; ++k) {
            for (int i = 0; i < n; ++i) {
                for (int j = 0; j < n; ++j){
                    if (K[i][k] == INF || K[k][j] == INF) continue;
                    K[i][j] = min(K[i][j], K[i][k] + K[k][j]);
                }
            }
        }
        return K;
    }

    auto runWithPath(void){
        std::vector<std::vector<std::pair<ll, std::list<ll>>>>
            K(n, std::vector<std::pair<ll, std::list<ll>>>(
                  n,
                  std::make_pair(INF, list<ll>())
                  )
                );

        for (int i = 0; i < n; ++i) {
            auto const &arcs = getInstance()[i].arcs;
            for(auto &x : arcs){
                if (K[i][x.to].first > x.cost) {
                    K[i][x.to].first = x.cost;
                    K[i][x.to].second.push_back(i);
                    K[i][x.to].second.push_back(x.to);
                }
            }
        }

        for (int k = 0; k < n; ++k) {
            for (int i = 0; i < n; ++i) {
                for (int j = 0; j < n; ++j) {
                    if (K[i][k].first == INF || K[k][j].first == INF) continue;

                    if (K[i][j].first > K[i][k].first + K[k][j].first) {
                        K[i][j].first = K[i][k].first + K[k][j].first;
                        K[i][j].second.insert(
                            K[i][j].second.end(),
                            K[k][j].second.begin(),
                            K[k][j].second.end()
                            );
                    }
                }
            }
        }
        return K;
    }
};

constexpr ll warshallFloyd::INF;

int main(void){
    cin.tie(0); ios::sync_with_stdio(false);

    int h, w;

    cin >> h >> w;

    vector<vector<int>> meiro(h, vector<int>(w, -1));

    int roadcount = 0;
    for0(i, h)for0(j, w){
    newline:
        char c;
        cin >> c;
        if (c == '\n') { goto newline; }

        if (c == '.')
          meiro[i][j] = roadcount++;
    }

    warshallFloyd b(roadcount);

    for0(i, h)for0(j, w){
        auto &x = meiro[i][j];
        if (x == -1) continue;

        // up
        auto &up = meiro[i - 1][j];
        if (i - 1 >= 0 && up != -1) { b.addEdge(x, up, 1); }

        // down
        auto &down = meiro[i + 1][j];
        if (i + 1 < h && down != -1) { b.addEdge(x, down, 1); }

        // left
        auto &left = meiro[i][j - 1];
        if (j - 1 >= 0 && left != -1) { b.addEdge(x, left, 1); }

        // right
        auto &right = meiro[i][j + 1];
        if (j + 1 < w && right != -1) { b.addEdge(x, right, 1); }
    }

    auto r = b.runWithPath();
    ll result = 0;
    for(auto &x : r){
        for(auto &y : x){
            if (y.first == warshallFloyd::INF) continue;
            // cout << y << " ";
            result = max(result, y.first);
        }
        // cout << "\n";
    }

    cout << result;

    return 0;
}
