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
import java.util.Arrays;
import java.util.*;
class Main
{
	static ArrayList<Integer> adj[];
	static int dpi[],dpo[],vis[];
	static int ans;
	public static void main (String[] args)
	{
		Scanner sc=new Scanner(System.in);
		int i;
		int n=sc.nextInt(); int m=sc.nextInt();
		dpi=new int[n]; dpo=new int[n];
		adj=new ArrayList[n]; ans=0;
		for(i=0;i<n;i++)
			adj[i]=new ArrayList();
		for(i=0;i<m;i++) 
		{
			int u=sc.nextInt()-1; int v=sc.nextInt()-1;
			adj[u].add(v); 
		}
		vis=new int[n];
		for(i=0;i<n;i++)
		{
			if(vis[i]==0)
				dfs(i,-1,0);
		}
		Arrays.fill(vis, 0);
		for(i=0;i<n;i++)
		{
			if(vis[i]==0)
				dfs(i,-1,0);
		}
		for(i=0;i<n;i++)
			if(dpi[i]+dpo[i]>ans)
				ans=dpi[i]+dpo[i];
		System.out.println(ans);
	}
	public static void dfs(int v,int p,int l)
	{
		vis[v]=1;
		dpi[v]=Math.max(dpi[v], l);
		if(p!=-1)
		{
			dpo[p]=Math.max(dpo[p], 1+dpo[v]);
			dpi[v]=Math.max(dpi[v], dpi[p]+1);
		}
		for(int node:adj[v])
		{
			if(vis[node]==0)
			{
				dfs(node,v,l+1);
				dpo[v]=Math.max(dpo[v], 1+dpo[node]);
			}
			else
			{
				dpi[node]=Math.max(dpi[node], dpi[v]+1);
				dpo[v]=Math.max(dpo[node]+1, dpo[v]);
			}
		}
		
	}
} 