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 javax.print.DocFlavor;
import java.util.ArrayList;
import java.util.Scanner;

class graphDP{

    int v;
    ArrayList<ArrayList<Integer>> adj = new ArrayList<>();

    graphDP(int x){

        v = x;
        for(int i=0;i<=v;i++){

            ArrayList<Integer> z = new ArrayList<>();
            adj.add(z);
        }

    }

    void add(int x , int y){
        adj.get(x).add(y);
    }

    void dfs(int x , int[] dp , boolean[] visited){


        visited[x] = true;
        for(int ver=0; ver<adj.get(x).size();ver++){
            int t= adj.get(x).get(ver);
            if(!visited[t]){

                dfs(t,dp,visited);

            }

            dp[x] = Math.max(dp[x],1+dp[t]);
        }




    }


}


public class Main {

    public static void main(String[] args) {

        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int m = in.nextInt();

        graphDP g = new graphDP(n);
        boolean[] visited = new boolean[n+1];

        for (int i = 0; i < m; i++) {

            int start = in.nextInt();
            int end = in.nextInt();
            g.add(start,end);
        }

        int[] dp = new int[n+1];

        for(int i=1;i<=n;i++){

            if(!visited[i]){

                g.dfs(i,dp,visited);

            }

        }

//        for(int i=0;i<dp.length;i++) {
//
//            System.out.println(dp[i] + " ");
//        }
//            System.out.println();

        int max = dp[0];
        for(int i=1;i<dp.length;i++){

            if(max<dp[i]) max = dp[i];
        }


        System.out.println(max);

    }
}
