// Slower C++ solution:
#include <iostream>

#include <vector>

#include <cmath>

#include <set>

#include <queue>

#include <map>

#include <cstdio>

#include <cstring>

#include <string>

#include <stack>

#include <algorithm>

#include <limits.h>

#include <bits/stdc++.h>

#define fw(x) freopen("x.txt","w",stdout)

#define For(i,a,b,c) for(int i = a;i < b;i+=c)

#define REP(i,n) for(int i = 0;i < n;++i)

#define REP1(i,n) for(int i = 1; i<=n;i++)

#define mem(a,s) memset(a,s,sizeof a)

#define fast ios_base::sync_with_stdio(0);cin.tie(NULL)

#define pf printf

#define sc scanf

#define ll long long

#define pii pair<int,int>

#define pll pair<ll,ll>

#define all(v) v.begin(),v.end()

#define vii vector<int>

#define vll vector<ll>

#define vss vector<string>

#define debug(x)  cout<<#x"="<<(x)<<endl

#define pb push_back





using namespace std;





// moves



//int dx[]= {0,0,1,-1};/*4 side move*/

//int dy[]= {-1,1,0,0};/*4 side move*/

//int dx[]= {1,1,0,-1,-1,-1,0,1};/*8 side move*/

//int dy[]= {0,1,1,1,0,-1,-1,-1};/*8 side move*/

//int dx[]={1,1,2,2,-1,-1,-2,-2};/*knight move*/

//int dy[]={2,-2,1,-1,2,-2,1,-1};/*knight move*/





//big_mod



//ll bigmod(ll a,ll b,ll m)

//{if(b == 0) return 1%m;ll x = bigmod(a,b/2,m);x = (x * x) % m;if(b % 2 == 1) x = (x * a)% m;return x;}

//ll BigMod(ll B,ll P,ll M){ ll R=1%M; while(P>0) {if(P%2==1){R=(R*B)%M;}P/=2;B=(B*B)%M;} return R;} /// (B^P)%M



//ll getBit(ll num, int idx) {return ((num >> idx) & 1ll) == 1ll;}

//ll setBit1(ll num, int idx) {return num or (1ll<<idx);}

//ll setBit0(ll num, int idx) {return num & ~(1ll<<idx);}

//ll flipBit(ll num, int idx) {return num ^ (1ll<<idx);}



const int mod = 1000000007;

int n, m, x, y;

vii gr[100001];

int len[100001];

int ans=0;

int dp(int cur){

  if(len[ cur ] == -1){

    int sz = gr[cur].size();

    if(sz>0){

      int mx = 0;

      for(int j=0; j<sz; j++){

        if(len[ gr[cur][j] ] == -1) {

          len[gr[cur][j]] = dp(gr[cur][j]);

          mx = max(mx, len[gr[cur][j]]);

        }

        else mx = max(mx, len[gr[cur][j]]);

      }

      len[cur] = mx+1;

      return len[cur];

    }

    else return 0;

  }

  else return len[cur];

}

int main()

{

    fast;

    mem(len, -1);

    cin>>n>>m;

    REP1(i, m){

      cin>>x>>y;

      gr[x].pb(y);

    }

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

        int sz=gr[i].size();

        if(sz>0){

          int mx=0;

          for(int j=0; j<sz; j++){

            if(len[ gr[i][j] ] == -1) {

              len[gr[i][j]] = dp(gr[i][j]);

              mx = max(mx, len[gr[i][j]]);

            }

            else mx = max(mx, len[gr[i][j]]);

          }

          len[i] = mx+1;

          ans = max(ans, mx+1);

        }

        else len[i] = 0;

    }

    cout<<ans<<'\n';

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.1283718379278884x):
#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e5+5;

vector<int> adj[maxn];

int dis[maxn];



int dfs(int cur)

{

	if(dis[cur] != 1) return dis[cur];

	else{



		int temp = 0;

		for(auto i : adj[cur]){

			temp = max(temp, dfs(i));

		}

		dis[cur] += temp;

	}

	return dis[cur];

}

int main(int argc, char const *argv[])

{

	int n, m; scanf("%d %d", &n, &m);

	int x, y;

	fill(dis, dis + n + 1, 1);

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

		scanf("%d %d", &x, &y);

		adj[x].push_back(y);

	}

	int ans = 1;

	for(int i = 1; i <= n; i++) ans = max(ans, dfs(i));

	/*	

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

		printf("%d ", dis[i]);

	}

	*/

	printf("%d\n", ans-1);



	return 0;

}