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 static java.lang.Math.max;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.List;
import java.util.Locale;
import java.util.Scanner;

public class Main {

	final static int INF = Integer.MAX_VALUE;
	static boolean[] visited;
	static List<Integer>[] lst;
	static List<Integer> ordered;

	public static void main(String[] args) {
		Locale.setDefault(Locale.ENGLISH);
		Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
		solve(in, System.out);
		in.close();
	}

	protected static void solve(Scanner in, PrintStream out) {
		int n = in.nextInt();
		int m = in.nextInt();
		lst = new ArrayList[n + 1];
		ordered = new ArrayList<>();
		for (int i = 1; i <= n; i++)
			lst[i] = new ArrayList<>();
		for (int j = 0; j < m; j++)
			lst[in.nextInt()].add(in.nextInt());
		int ret = solveLine(n, m);
		out.printf(Locale.ENGLISH, "%s%n", ret);
	}

	private static int solveLine(int n, int m) {
		int ans = 0;
		visited = new boolean[n + 1];
		for (int i = 1; i <= n; i++) {
			if (!visited[i]) topoVisit(i);
		}
		int[] dp = new int[n + 1];
		for (int i = n - 1; i >= 0; i--) {
			int val = ordered.get(i);
			for (int a : lst[val]) {
				dp[a] = i == n - 1 ? 1 : max(dp[a], dp[val] + 1);
				ans = max(ans, dp[a]);
			}
		}
		return ans;
	}

	private static void topoVisit(int pos) {
		visited[pos] = true;
		for (int a : lst[pos]) {
			if (!visited[a]) {
				topoVisit(a);
			}
		}
		ordered.add(pos);
	}

}