// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;


int main() {
    int n; cin >> n; //emberek sama

    int t; cin >> t; //kapcsolatok száma

    vector<vector<int>> szomszedsagi(n+1);

    for (int i = 0; i < t; i++) {
        int parent, child;
        cin >> parent >> child;

        szomszedsagi[parent].push_back(child);
    }

    vector<int> max_vec(n+1, 0);

    for (int i = 1; i <= n; i++) {
        int unokak = 0;
        for (int j = 0; j < szomszedsagi[i].size(); j++) {
            unokak += szomszedsagi[szomszedsagi[i][j]].size();
        }
        max_vec[i] = unokak;
    }

    int maximum = 0, max_i = -1;

    for (int i = 1; i <= n; i++) {
        if (max_vec[i] > maximum) {
            maximum = max_vec[i];
            max_i = i;
        }
    }

    if (maximum != 0) {
        cout << max_i << " " << maximum;
    } else {
        cout << "-1";
    }

}