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.*;

class Main {


    public static int longestPathInADAG(int N, Map<Integer, List<Integer> > graph, int[] indegree) {

        Queue<Integer> q = new LinkedList<>();
        int[] topoOrder = new int[N];
        int topIdx = 0;
        for(int i=1; i<=N; i++) {
            if(indegree[i] == 0)
                q.add(i);
        }

        while(!q.isEmpty()) {
            Integer node = q.poll();
            topoOrder[topIdx++] = node;

            for(Integer nei: graph.getOrDefault(node, new ArrayList<>())) {
                if(--indegree[nei] == 0) {
                    q.add(nei);
                }
            }
        }

        int[] longestPath = new int[N + 1];

        for(int i=0; i<N; i++) {
            int currNode = topoOrder[i];

            for(Integer nei: graph.getOrDefault(currNode, new ArrayList<>())) {
                longestPath[nei] = Math.max(longestPath[nei], longestPath[currNode] + 1);
            }
        }

        int answer = Integer.MIN_VALUE;

        for(int i=1; i<=N; i++) {
            answer = Math.max(answer, longestPath[i]);
        }
        return answer;
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        Map<Integer, List<Integer> > graph = new HashMap<>();

        int N = scanner.nextInt();
        int M = scanner.nextInt();

        int[] indegree = new int[N + 1];

        for(int i=0; i<M; i++) {
            int from = scanner.nextInt();
            int to = scanner.nextInt();
            List<Integer> edges = graph.getOrDefault(from, new ArrayList<>());
            edges.add(to);
            indegree[to]++;
            graph.put(from, edges);
        }

        System.out.println(longestPathInADAG(N, graph, indegree));
    }
}
