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.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {

    static int max(int a, int b){
        if( a > b)
            return a;
        return b;
    }

    static int[] dp;
    static int calculate(List<Integer>[] graph,int i){
        if(dp[i] != -1){
            return dp[i];
        }
        int path = 0;
        if(graph[i] != null){
            for(Integer ii : graph[i]){
                path = max(path,1+calculate(graph,ii));
            }
        }
        dp[i] = path;
        return dp[i];
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        List<Integer>[] graph = new ArrayList[n];
        dp = new int[n];

        int[] dist = new int[n];

        for(int i = 0; i < n; i++){
            dist[i] = Integer.MIN_VALUE;
            dp[i] = -1;
        }

        for(int i = 0; i < m; i++){
            int x = sc.nextInt();
            int y = sc.nextInt();
            if(graph[x-1] == null)
                graph[x-1] = new ArrayList<Integer>();
            graph[x-1].add(y-1);
        }

        int max = 0;
        for(int i = 0; i < n; i++){
            max = max(max,calculate(graph,i));
        }

        System.out.println(max);
    }
}
