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.io.*;
import java.util.*;
public class Main {
    static int dfs(ArrayList<Integer>[] gh, int curv, HashMap<Integer, Integer> map, HashSet<Integer> visited) {
        if(gh[curv] == null)
            return 0;
        if(map.containsKey(curv)) 
            return map.get(curv);
        visited.add(curv);
        int maxd = 0;
        for(int v2 : gh[curv]) {
            maxd = Math.max(dfs(gh, v2, map, visited), maxd);
        }
        maxd++;
        map.put(curv, maxd);
        return maxd;
    }
    
    public static void main(String args[]) {
        int n = 0, m = 0;
        ArrayList<Integer>[] gh = null;
        try (Scanner scanner = new Scanner(System.in)) {
            n = scanner.nextInt();
            m = scanner.nextInt();
            
            gh = new ArrayList[n + 1];
            for(int i = 0; i< m; i++){
                int v1 = scanner.nextInt();
                int v2 = scanner.nextInt();
                if(gh[v1] == null)
                    gh[v1] = new ArrayList();
                gh[v1].add(v2);
            }
            
        }
        
        HashSet<Integer> visited = new HashSet();
        HashMap<Integer, Integer> map = new HashMap();
        int max = 0;
        for(int i = 1; i <= n; i++) {
            if(gh[i] != null && !visited.contains(i))
                max = Math.max(max, dfs(gh, i, map, visited));
        }
        
        System.out.println(max);
        
    }
}