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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String[] header = reader.readLine().split(" ");
        int vertexCount = Integer.parseInt(header[0]);
        int edgeCount = Integer.parseInt(header[1]);

        Map<Integer, List<Integer>> edges = new HashMap<>();
        for (int i = 0; i < vertexCount; ++i) {
            edges.put(i, new ArrayList<>());
        }
        int[] incoming = new int[vertexCount];

        for (int i = 0; i < edgeCount; ++i) {
            String[] parts = reader.readLine().split(" ");
            int src = Integer.parseInt(parts[0]) - 1;
            int dst = Integer.parseInt(parts[1]) - 1;
            edges.get(src).add(dst);
            incoming[dst] += 1;
        }

        ArrayDeque<Integer> queue = new ArrayDeque<>();
        for (int i = 0; i < vertexCount; ++i) {
            if (incoming[i] == 0) {
                queue.addLast(i);
            }
        }

        ArrayList<Integer> sorted = new ArrayList<>();
        while (!queue.isEmpty()) {
            int vertex = queue.removeFirst();
            for (int dst : edges.get(vertex)) {
                incoming[dst] -= 1;
                if (incoming[dst] == 0) {
                    queue.addLast(dst);
                }
            }
            sorted.add(vertex);
        }

        int[] dp = new int[vertexCount];
        int maxPath = 0;
        for (int vertex : sorted) {
            for (int dst : edges.get(vertex)) {
                dp[dst] = Math.max(dp[dst], dp[vertex] + 1);
                maxPath = Math.max(maxPath, dp[dst]);
            }
        }

        System.out.println(maxPath);
    }
}
