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 {
    public static void main(String [] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
        Map<Integer,ArrayList<Integer>> Edge = new HashMap<>();
        Map<Integer,ArrayList<Integer>> Edge2 = new HashMap<>();
        Map<Integer,ArrayList<Integer>> Edge3 = new HashMap<>();
        int DP [] = new int[N+1];
        Arrays.fill(DP,0);
        ArrayList<Integer> S = new ArrayList<>();
        Queue<Integer> L = new ArrayDeque<>();
        for(int i=0;i<M;i++){
            int x = sc.nextInt();
            int y = sc.nextInt();
            if(Edge.get(y)==null){
                ArrayList<Integer> E = new ArrayList<>();
                ArrayList<Integer> E2 = new ArrayList<>();
                E.add(x);
                E2.add(x);
                Edge.put(y,E);
                Edge3.put(y,E2);
            }
            else{
                Edge.get(y).add(x);
                Edge3.get(y).add(x);
            }
            if(Edge2.get(x)==null){
                ArrayList<Integer> E = new ArrayList<>();
                E.add(y);
                Edge2.put(x,E);
            }
            else Edge2.get(x).add(y);
        }
        int max = 0;
        for(int i=1;i<N+1;i++) if(Edge.get(i)==null) L.add(i);
        while(L.size()!=0) {
            int source = L.poll();
            S.add(source);
            if(Edge2.get(source)!=null){
                for(int sink:Edge2.get(source)){
                    Edge.get(sink).remove(Edge.get(sink).indexOf(source));
                    DP[sink] = Math.max(DP[sink],DP[source]+1);
                    if(max<DP[sink])max =DP[sink];
                    if(Edge.get(sink).size()==0) L.add(sink);
                }
            }
        }
        System.out.println(max);
    }
}