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

public class Main {

  static boolean visited[];
  static Map<Integer, List<Integer>> entry;
  static int[] inDegree;
  static int[] dp;

  public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);
    int N = scanner.nextInt();
    int M = scanner.nextInt();
    int[][] path = new int[M][2];
    entry = new HashMap<>();
    visited = new boolean[N + 1];
    inDegree = new int[N + 1];
    dp = new int[N + 1];
    for (int i = 0; i < M; i++) {
      path[i][0] = scanner.nextInt();
      path[i][1] = scanner.nextInt();

      List<Integer> orDefault = entry.getOrDefault(path[i][0], new ArrayList<>());
      orDefault.add(path[i][1]);
      entry.put(path[i][0], orDefault);
      inDegree[path[i][1]] = inDegree[path[i][1]] + 1;
    }
    System.out.println(solve(N));
  }

  private static int solve(int N) {

    for (Map.Entry<Integer, List<Integer>> en : entry.entrySet()) {
      if (!visited[en.getKey()] && inDegree[en.getKey()] == 0) {
        dfs(en.getKey());
      }
    }
    int ans = 0;
    for (int i = 0; i < dp.length; i++) {
      ans = Math.max(ans, dp[i]);
    }
    return ans;
  }

  public static void dfs(int a) {
    visited[a] = true;
    if (entry.containsKey(a)) {
      for (Integer integer : entry.get(a)) {
        dp[integer] = Math.max(dp[integer], dp[a] + 1);
        inDegree[integer]--;
        if (inDegree[integer] == 0) {
          dfs(integer);
        }
      }
    }
  }
}
