#include <bits/stdc++.h>
using namespace std;
bool dfs(int i, vector<int>& seen, vector<vector<int> >& g)
{
    seen[i] = 1;
    for (auto& j : g[i]) {
        if (seen[j] == 1 || (seen[j] == 0 && dfs(j, seen, g))) {
            return true;
        }
    }
    seen[i] = 2;
    return false;
}
int main()
{
    int n, q;
    cin >> n >> q;
    vector<pair<int, int> > edges(q);
    for (int i = 0; i < q; i++) {
        int a, b;
        cin >> a >> b;
        edges[i] = { a - 1, b - 1 };
    }
    int l = -1, r = q + 1;
    while (r - l > 1) {
        int mid = (l + r) / 2;
        vector<vector<int> > g(n);
        for (int i = 0; i < mid; i++)
            g[edges[i].first].push_back(edges[i].second);
        vector<int> seen(n, 0);
        bool has_cycle = false;
        for (int i = 0; i < n; i++) {
            if (seen[i] == 0 && dfs(i, seen, g)) {
                has_cycle = true;
                break;
            }
        }
        if (has_cycle)
            r = mid;
        else
            l = mid;
    }
    cout << (r == q + 1 ? -1 : r) << endl;
}