Problem: There is a directed graph G with N vertices and M edges. The vertices are numbered 1, 2, \ldots, N, and for each i (1 \leq i \leq M), the i-th directed edge goes from Vertex x_i to y_i. G does not contain directed cycles.

Find the length of the longest directed path in G. Here, the length of a directed path is the number of edges in it.

Constraints

* All values in input are integers.
* 2 \leq N \leq 10^5
* 1 \leq M \leq 10^5
* 1 \leq x_i, y_i \leq N
* All pairs (x_i, y_i) are distinct.
* G does not contain directed cycles.

Input

Input is given from Standard Input in the following format:


N M
x_1 y_1
x_2 y_2
:
x_M y_M


Output

Print the length of the longest directed path in G.

Examples

Input

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


Output

3


Input

6 3
2 3
4 5
5 6


Output

2


Input

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


Output

3

Solution (in JAVA):

Solution:
import java.util.*;

public class Main
{
	static void addEdge(ArrayList<ArrayList<Integer>> adj,int u,int v)
	{
		adj.get(u).add(v);
	}
	
	static int dfs(ArrayList<ArrayList<Integer>> adj,int x,boolean visited[],int dp[])
	{
		visited[x]=true;
		dp[x]=0;
		for(int i=0;i<adj.get(x).size();i++)
		{
			if(!visited[adj.get(x).get(i)])
			{
				dp[adj.get(x).get(i)]=dfs(adj,adj.get(x).get(i),visited,dp);
			}
			if(dp[x]<dp[adj.get(x).get(i)]+1)
				dp[x]=dp[adj.get(x).get(i)]+1;
		}
		return dp[x];
	}
	
	public static void main(String[] args)
	{
		Scanner in=new Scanner(System.in);
		int n=in.nextInt();
		int m=in.nextInt();
		ArrayList<ArrayList<Integer>> adj=new ArrayList<ArrayList<Integer>>();
		for(int i=0;i<=n;i++)
			adj.add(new ArrayList<Integer>());
		for(int i=0;i<m;i++)
			addEdge(adj,in.nextInt(),in.nextInt());
		boolean visited[]=new boolean[n+1];
		int dp[]=new int[n+1];
		Arrays.fill(visited, false);
		int ans=0;
		for(int i=1;i<=n;i++)
		{
			if(!visited[i])
				dp[i]=dfs(adj,i,visited,dp);
			if(ans<dp[i])
				ans=dp[i];
		}
		System.out.println(ans);
	}
}