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.*;
import java.util.*;

class Main{
    /**
     * https://atcoder.jp/contests/dp/tasks/dp_g
     * refs: www.mathcs.emory.edu/~cheung/Courses/171/Syllabus/11-Graph/Docs/longest-path-in-dag.pdf
     * 
     */ 

    static int[] dist;
    static int[] parentsCount;
    static LinkedList<Integer>[] adjList;
    static boolean[] visited;

    public static void dfs(int parent){

        visited[parent] = true;
        Iterator<Integer> iter = adjList[parent].iterator();

        while(iter.hasNext()){
            int child = iter.next();
            dist[child] = Math.max(dist[child], dist[parent] + 1);
            parentsCount[child]--;
            if(parentsCount[child] == 0)
                dfs(child);
        }
    }

    public static void main(String[] args) {

        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int m = in.nextInt();
        dist = new int[n + 1]; 
        parentsCount = new int[n + 1]; 
        adjList = new LinkedList[n + 1];
        visited = new boolean[n + 1];

        for(int i = 0; i <= n; i++) adjList[i] = new LinkedList<>();
        Arrays.fill(dist, 0);
        Arrays.fill(parentsCount, 0);   // verbose

        for(int i = 0; i < m; i++){
            int from = in.nextInt();
            int to = in.nextInt();
            adjList[from].add(to); // populate adjacency list
            parentsCount[to]++;
        }
        for(int i = 1; i <= n; i++){
            if( !visited[i] && parentsCount[i] == 0)
                dfs(i);
        }

        int ret = 0;
        for(int i = 1; i <= n; i++)
            ret = Math.max(ret, dist[i]);
        
        System.out.println(ret);
    }
}