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.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {


    private static void dfs(int i, ArrayList<Integer>[] map, int[] degree, int[] dist, boolean[] visited) {
        if(visited[i]) {
            return;
        }
        visited[i] = true;
        if(map[i] == null) {
            return;
        }
        for (Integer to : map[i]) {
            degree[to]--;
            dist[to] = Math.max(dist[i] + 1, dist[to]);
            if(degree[to] == 0) {
                dfs(to, map, degree, dist, visited);
            }
        }
    }
    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int m = scanner.nextInt();
        int[] degree = new int[n+1];
        boolean[] visited = new boolean[n+1];
        int[] dist = new int[n+1];
        ArrayList<Integer>[] map = new ArrayList[n+1];
        for (int i = 0; i < m; i++) {
            int from = scanner.nextInt();
            int to = scanner.nextInt();
            if(map[from] == null) {
                map[from] = new ArrayList<>();
            }
            map[from].add(to);
            ++degree[to];
        }

        for (int i = 0; i < n + 1; i++) {
           if(!visited[i] && degree[i] == 0) {
               dfs(i, map, degree, dist, visited);
           }
        }
        int max = 0;
        for (int i = 0; i < n + 1; i++) {
           max = Math.max(max, dist[i]);
        }
        System.out.println(max);
    }


}