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

class Main {
    static class Graph {
        int V;
        List<Integer> adj[];
        int[] indegree;
        int[] dist;
        public Graph(final int V) {
            this.V = V;
            adj = new List[V];
            indegree = new int[V];
            dist = new int[V];
            for(int i = 0; i < V; i++) {
                adj[i] = new ArrayList<>();
            }
        }
        public void addEdge(int u, int v) {
            adj[u].add(v);
            indegree[v]++;
        }
    }
    public static void dfs(Graph g, int i, boolean[] visited) {
        if(visited[i]) {
            return;
        }
        visited[i] = true;
        for(int j : g.adj[i]) {
            g.dist[j] = Math.max(g.dist[j], g.dist[i] + 1);
            --g.indegree[j];
            if(g.indegree[j] == 0) {
                dfs(g, j, visited);
            }
        }
    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        if(m == 0) {
            System.out.println(0);
            return;
        }
        Graph g = new Graph(n);
        for(int i = 0; i < m; i++) {
            g.addEdge(sc.nextInt() - 1, sc.nextInt() - 1);
        }
        boolean[] visited = new boolean[n];
        for(int i = 0; i < n; i++) {
            if(g.indegree[i] == 0) {
                dfs(g, i, visited);
            }
        }
        int max = 0;
        for(int d : g.dist) {
            if(max < d) {
                max = d;
            }
        }
        System.out.println(max);
    }
}