A - Robot Rapping Results Report

题目：

While Farmer John rebuilds his farm in an unfamiliar portion of Bovinia, Bessie is out trying some alternative jobs. In her new gig as a reporter, Bessie needs to know about programming competition results as quickly as possible. When she covers the 2016 Robot Rap Battle Tournament, she notices that all of the robots operate under deterministic algorithms. In particular, robot i will beat robot j if and only if robot i has a higher skill level than robot j. And if robot i beats robot j and robot j beats robot k, then robot i will beat robot k. Since rapping is such a subtle art, two robots can never have the same skill level.

Given the results of the rap battles in the order in which they were played, determine the minimum number of first rap battles that needed to take place before Bessie could order all of the robots by skill level.

Input

The first line of the input consists of two integers, the number of robots n (2 ≤ n ≤ 100 000) and the number of rap battles m ().

The next m lines describe the results of the rap battles in the order they took place. Each consists of two integers ui and vi (1 ≤ ui, vi ≤ n, ui ≠ vi), indicating that robot ui beat robot vi in the i-th rap battle. No two rap battles involve the same pair of robots.

It is guaranteed that at least one ordering of the robots satisfies all m relations.

Output

Print the minimum k such that the ordering of the robots by skill level is uniquely defined by the first k rap battles. If there exists more than one ordering that satisfies all m relations, output -1.

Examples

Input

4 5
2 1
1 3
2 3
4 2
4 3

Output

4

Input

3 2
1 2
3 2

Output

-1

Note

In the first sample, the robots from strongest to weakest must be (4, 2, 1, 3), which Bessie can deduce after knowing the results of the first four rap battles.

In the second sample, both (1, 3, 2) and (3, 1, 2) are possible orderings of the robots from strongest to weakest after both rap battles.

题意：

给你一些数据，每一行有一个a，b，代表a在b前面，然后让你判断是否存在唯一的排序，如果存在，输出最小能得出结果在第几组数据，否则输出-1；

思路：

输入时存储每个数字的入度，然后把入度为0的存入队列中，如果队列中的个数大于1，就代表有多个数的入度为0，这就说明拓扑序不是唯一的；

把两个拓扑序相邻的点的这条边存起来,最后遍历一遍输入的信息,恰好把这些边减完就是最少的数对数量了;

代码如下：

#include<stdio.h>
#include<string.h>
#include<queue>
#include<vector>
using namespace std;
#define N 100010

int a[N],b[N],in[N],ans[N];
int n,m;
queue<int>Q;
vector<int>q[N];

int main()
{
    scanf("%d%d",&n,&m);
    int i,j;
    memset(in,0,sizeof in);
    memset(ans,0,sizeof ans);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&a[i],&b[i]);
        in[b[i]]++;//存储入度；
        q[a[i]].push_back(b[i]);//把两个拓扑序相邻的点的这条边存起来
    }
    int s=0,sum=0,k,t;
    for(i=1;i<=n;i++)
    {
        if(in[i]==0)//找到入度为0的点；
        {
            sum++;//记录队列中元素的个数；
            Q.push(i);
        }
    }
    while(!Q.empty())
    {
        if(sum>=2)//不唯一；
        {
            printf("-1\n");
            return 0;
        }
        k=Q.front();
        Q.pop();
        sum--;
        for(i=0;i<q[k].size();i++)
        {
            t=q[k][i];
            in[t]--;//相邻的点的入度减1；
            if(in[t]==0)//入度为0，入队列；
            {
                sum++;//队列元素增加；
                Q.push(t);
                ans[t]=k;
                s++;
            }
        }
    }
    for(i=1;i<=m;i++)//遍历一遍输入的信息,恰好把这些边减完就是最少的数对数量了;
    {
        if(ans[b[i]]==a[i])
        {
            s--;
            if(s==0)
            {
                printf("%d\n",i);
                break;
            }
        }
    }
    return 0;
}