Robot Rapping Results Report

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.

题解：有n个机器人，然后打了m场比赛，m场比赛描述是:A打败了B，如果A打败B，B打败C，那么A就能打败C。

现在问你，最少只需要前多少场比赛就能够知道顺序了。或者说无论如何都不能知道，输出-1。

思路：跑一遍拓扑排序，判断是否有唯一拓扑序列，同时记录这个拓扑序列用到的编号最大的边。

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
	int x,y,next;
}e[120000];
int main()
{
	int n,m;
	while(~scanf("%d%d",&n,&m))
	{
		int frist[101010],book[101010],a[101010];
		int sum=0,flag=1,i,j;
		memset(frist,-1,sizeof(frist));
		memset(book,0,sizeof(book));
		for(i=1;i<=m;i++)
		{
			scanf("%d%d",&e[i].x,&e[i].y);
			e[i].next=frist[e[i].x];
			frist[e[i].x]=i;
			book[e[i].y]++;
		}
		for(i=1;i<=n;i++)
		{
			if(!book[i])
			 a[sum++]=i;
		}
		if(sum!=1) flag=0;
		int num=0,maxx=-100;
		for(i=0;i<sum;i++)
		{
			num=0;
			for(j=frist[a[i]];j!=-1;j=e[j].next)
			{
				book[e[j].y]--;
				if(book[e[j].y]==0)
				{
					a[sum++]=e[j].y;
					num++;
					if(j>maxx)
					 maxx=j;
				}
			}
			if(num>1)
			flag=0;
		 } 
		if(!flag||sum<n)
			printf("-1\n");
	    else
			printf("%d\n",maxx);
	}
}