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 krap 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.

 

题意：

给定n个机器人的m个能力大小关系，问你至少要前几个大小关系就可以得到所有机器人的能力顺序。

 

思路：

拓扑排序，每次保证入度为0的只有一个，同时记录编号最大的边。

 

代码：

#include<stdio.h>
#include<string.h>
struct node
{
    int x,y,next;
} e[100861];
int head[100861],book[100861]= {0},b[100861];
int main()
{
    memset(head,-1,sizeof(head));
    int n,m,a;
    scanf("%d%d",&n,&m);
    for(int i=1; i<=m; i++)
    {
        scanf("%d%d",&e[i].x,&e[i].y);
        e[i].next=head[e[i].x];
        head[e[i].x]=i;
        book[e[i].y]++;
    }
    int sum=0,flag=1,maxx=0,f;
    for(int i=1; i<=n; i++)
        if(book[i]==0)
        {
            b[sum++]=i;
        }
    if(sum!=1)
        flag=0;
    for(int i=0; i<sum; i++)
    {
        int num=0;
        for(int j=head[b[i]]; j!=-1; j=e[j].next)
        {
            book[e[j].y]--;
            if(book[e[j].y]==0)
            {
                b[sum++]=e[j].y;
                num++;
                if(j>maxx)
                    maxx=j;
            }
        }
        if(num>1)
            flag=0;
    }
    if(flag==0||sum<n)
        printf("-1\n");
    else
        printf("%d\n",maxx);
    return 0;
}