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

pair<int, int> dfs(int node, vector<vector<int>>& adj, vector<int>& cnt) {
	pair<int, int> p = {1, 0};

	for (auto child : adj[node]) {
		auto tmp_p = dfs(child, adj, cnt);
		cnt[node] += tmp_p.second;
		p.second += tmp_p.first;
	}

	return p;
}

int main() {
	int n, m;
	cin >> n >> m;
	vector<vector<int>> adj(n);
	vector<int> indegree(n);
	for (int i = 0; i < m; ++i) {
		int j, c;
		cin >> j >> c;
		--j;
		--c;
		adj[j].push_back(c);
		++indegree[c];
	}

	int root = 0;

	for (int i = 0; i < n; ++i) {
		if (indegree[i] == 0) {
			root = i;
		}
	}

	vector<int> cnt(n);

	dfs(root, adj, cnt);

	int ans = 0;

	for (int i = 0; i < n; ++i) {
		if (cnt[i] > cnt[ans]) {
			ans = i;
		}
	}

	if (cnt[ans]) {
		cout << ans + 1 << " " << cnt[ans] << endl;
	} else {
		cout << -1 << endl;
	}
}