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

public class Main {
    public static int N;
    public static int M;

    public static ArrayList<Integer> Vertices[];
    public static int dp[];

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PrintWriter p = new PrintWriter(System.out);
        N = sc.nextInt();
        M = sc.nextInt();

        Vertices = new ArrayList[N + 1];
        dp = new int[N + 1];

        for(int i=1; i<=N; ++i)
            Vertices[i] = new ArrayList<>();

        for (int m = 1; m <= M; ++m) {
            int beg = sc.nextInt();
            int end = sc.nextInt();
            Vertices[beg].add(end);
        }

        int r = 0;

        for (int i = 1; i <= N; ++i) {
            if (Vertices[i].size() > 0) {
                r = Math.max(r, dfs(i));
            }
        }

        p.println(r);
        p.close();
    }

    public static int dfs(int idxBegVertex) {
        if(dp[idxBegVertex] > 0) {
            return dp[idxBegVertex];
        }

        for(int idxEndVertex: Vertices[idxBegVertex]) {
            dfs(idxEndVertex);
            dp[idxBegVertex] = Math.max(dp[idxBegVertex], dp[idxEndVertex] + 1);
        }

        return dp[idxBegVertex];
    }
}
