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.*;
import java.io.*;
public class Main {
    public static int dp[];
    public static int getLen(ArrayList<ArrayList<Integer>> arr , int s){
        if(dp[s] != -1){
            return dp[s];
        }
        int ans = 0;
        for(int j = 0 ; j < arr.get(s).size() ; j++){
            int temp = arr.get(s).get(j);
            
            ans = Math.max(ans , getLen(arr , temp) + 1);
        }

        // System.out.println(ans);
        return dp[s] = ans;
    }
    public static int solve(ArrayList<ArrayList<Integer>> arr){
        int ans = 0;
        for(int i = 0 ; i < arr.size() ; i++){
            ans = Math.max(ans , getLen(arr , i));
        }
        // ans = getLen(arr , 4);
        return ans;
    }
    public static void main(String args[]) {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        int m = s.nextInt();
        dp = new int[n];

        for(int i = 0 ; i < n ; i++){
            dp[i] = -1;
        }
        
        // int arr[][] = new int[n][n];

        ArrayList<ArrayList<Integer>> arr = new ArrayList<>();
        for(int i = 0 ; i < n ; i++){
            arr.add(new ArrayList<Integer>());
        }

        for(int i = 0 ; i < m ; i++){
            int first = s.nextInt() - 1;
            int second = s.nextInt() - 1;
            // arr[first][second] = 1;
            arr.get(first).add(second);
        }
        
        System.out.println(solve(arr));
        // for(int i = 0 ; i < n ; i++){
        //     System.out.println(dp[i]);
        // }
    }
}