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.awt.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedList;
import java.util.Scanner;
import java.lang.*;
public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Problem ThanhYeuThu = new Problem();
		ThanhYeuThu.solve();
	}
	static class Graph {
		int n,m;
		private ArrayList<Integer> a[]; 
		private ArrayList<Integer> Topo;
		public void TaoDoThi(int N,int M) {
			n = N;
			m = M;
			a = new ArrayList[n + 1];
			for (int i = 0; i <= n; i++) a[i] = new ArrayList<>();
		}
		public void addEdge(int u,int v) {
			a[u].add(v);
		}
	}
	static class TopoSort {
		private ArrayList<Integer> Topo = new ArrayList<>();
		boolean KT[];
		void init(Graph G) {
			KT = new boolean[G.n + 1];
			for (int i = 0; i <= G.n; i++) KT[i] = false;
		}
		void DFS(Graph G,int u) {
			KT[u] = true;
			for (int v : G.a[u]) {
				if (KT[v] == false) DFS(G,v);
			}
			Topo.add(u);
		}
	}
	static class Problem {
		public void solve() {
			Scanner sc = new Scanner(System.in);
			int N = sc.nextInt();
			int M = sc.nextInt();
			Graph G = new Graph();
			G.TaoDoThi(N, M);
			for (int i = 0; i < M; i++) {
				int u = sc.nextInt();
				int v = sc.nextInt();
				G.addEdge(u, v);
			}
			TopoSort TP = new TopoSort();
			TP.init(G);
			for (int i = 1; i <= N; i++) {
				if (TP.KT[i] == false) {
					TP.DFS(G,i);
				}
			}
			Collections.reverse(TP.Topo);
//			for (int x : TP.Topo) System.out.print(x + " ");
			int DP[] = new int[N + 1];
			int Res = 0;
			for (int u : TP.Topo) {
				DP[u] = Math.max(DP[u],1);
				Res = Math.max(Res, DP[u]);
				for (int v : G.a[u]) {
					DP[v] = Math.max(DP[v],DP[u] + 1);
				}
			}
			System.out.print(Res - 1);
		}
	}

}
