#include <bits/stdc++.h>
using namespace std;
const int maxn=1000010;
inline int read()
{
	char ch=getchar();
	int x=0;
	while(!isdigit(ch))
		ch=getchar();
	while(isdigit(ch))
	{
		x=x*10+ch-'0';
		ch=getchar();
	}
	return x;
}

int n,m;
struct edge
{
	int to,nex;
}e[maxn<<1];
struct node
{
	int x,y;
}b[maxn];
int point[maxn],cnt=0;

inline void add(int x,int y)
{
	e[++cnt].to=y;
	e[cnt].nex=point[x];
	point[x]=cnt;
}

int st[maxn],top=0,vis[maxn],d[maxn];
int dfn[maxn],low[maxn],color[maxn],scc=0,id=0;
int f[maxn],ans,in[maxn];
void tarjan(int u)
{
	dfn[u]=low[u]=++id;
	st[++top]=u,vis[u]=1;
	for(int i=point[u];i;i=e[i].nex)
	{
		int v=e[i].to;
		if(!dfn[v])
		{
			tarjan(v);
			low[u]=min(low[u],low[v]);
		}
		else if(vis[v])
			low[u]=min(low[u],dfn[v]);
	}
	if(dfn[u]==low[u])
	{
		vis[u]=0;
		color[u]=++scc;
		f[scc]=1;
		ans=max(ans,f[scc]);
		while(st[top]!=u)
		{
			color[st[top]]=scc;
			f[scc]++;
			ans=max(ans,f[scc]);
			vis[st[top--]]=0;
		}
		top--;
	}
}
void spfa(int x)
{
	queue <int> q;
	int u,v;
	memset(d,0,sizeof(d));
	memset(vis,0,sizeof(vis));
	q.push(x),vis[x]=1,d[x]=f[x];
	while(!q.empty())
	{
		u=q.front();
		q.pop();
		vis[u]=0;
		for(int i=point[u];i;i=e[i].nex)
		{
			v=e[i].to;
			if(d[v]<d[u]+f[v])
			{
				d[v]=d[u]+f[v];
				if(!vis[v])
				{
					vis[v]=1;
					q.push(v);
				}
			}
		}
	}
	for(int i=1;i<=scc;i++)
		ans=max(ans,d[i]);
}
int main()
{
	//freopen("bomb4.in","r",stdin);
	//freopen("bomb.out","w",stdout);
	int i,x,y;
	n=read(),m=read();
	for(i=1;i<=m;i++)
	{
		b[i].x=read(),b[i].y=read();
		add(b[i].x,b[i].y);
	}
	for(i=1;i<=n;i++)
		if(!dfn[i])
			tarjan(i);
	memset(point,0,sizeof(point));
	cnt=0;
	for(i=1;i<=m;i++)
		if(color[b[i].x]!=color[b[i].y])
		{
			add(color[b[i].x],color[b[i].y]);
			in[color[b[i].y]]++;
		}
	for(i=1;i<=scc;i++)
		if(!in[i])
			spfa(i);
	cout<<ans;	
}