/* LittleFall : Hello! */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
inline int read();
const int M = 3024, MOD = 1000000007;

int n, m;
vector<int> edg[M];
int dis[M][M];
vector<pair<int, int>> dis_from[M], dis_to[M];
bool cmp(pair<int, int> a, pair<int, int> b) { return a.second > b.second; }
void build() {
    n = read(), m = read();
    while (m--) {
        int a = read(), b = read();
        edg[a].push_back(b);
    }

    memset(dis, -1, sizeof(dis));
    for (int s = 1; s <= n; ++s) {
        queue<int> q;
        q.push(s);
        dis[s][s] = 0;
        while (!q.empty()) {
            int u = q.front();
            q.pop();
            for (int v : edg[u]) {
                if (dis[s][v] == -1) {
                    q.push(v);
                    dis[s][v] = dis[s][u] + 1;
                }
            }
        }
        // for(int t=1; t<=n; ++t)
        // {
        // 	printf("%d ",dis[s][t] );
        // }
        // printf("\n");
    }
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            if (dis[i][j] > 0) {
                dis_from[i].push_back({ j, dis[i][j] });
                dis_to[j].push_back({ i, dis[i][j] });
            }
        }
    }
    for (int i = 1; i <= n; ++i) {
        sort(dis_from[i].begin(), dis_from[i].end(), cmp);
        sort(dis_to[i].begin(), dis_to[i].end(), cmp);
    }
}
int main(void) {
#ifdef _LITTLEFALL_
    freopen("in.txt", "r", stdin);
#endif

    build();  //读入并建图，然后传递闭包

    int ans = 0, ans2 = 0;
    for (int x2 = 1; x2 <= n; ++x2)
        for (int x3 = 1; x3 <= n; ++x3)
            if (dis[x2][x3] > 0) {
                int t1 = -1, t2 = -1;
                for (int i = 0; i < min(3, (int)dis_to[x2].size()); ++i) {
                    if (dis_to[x2][i].first == x3)
                        continue;
                    for (int j = 0; j < min(3, (int)dis_from[x3].size()); ++j) {
                        auto ex1 = dis_to[x2][i], ex4 = dis_from[x3][j];
                        if (ex4.first == x2)
                            continue;
                        if (ex1.first == ex4.first)
                            continue;
                        if (ex1.second + ex4.second > t1 + t2) {
                            // printf("%d %d %d %d \n",ex1.first,x2,x3,ex4.first );
                            t1 = ex1.second;
                            t2 = ex4.second;
                        }
                    }
                }
                if (t1 == -1 || t2 == -1)
                    continue;

                int tmp = t1 + t2 + dis[x2][x3], tmp2 = x2;
                if (tmp > ans || (tmp == ans && tmp2 < ans2)) {
                    // printf("tmp=%d x2=%d x3=%d\n",ans,x2,x3 );
                    ans = tmp;
                    ans2 = tmp2;
                }
            }
    cout << ans << " " << ans2 << endl;

    return 0;
}

inline int read() {
    int x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x * f;
}