#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
//#define int long long
//#define LL long long
#define double long double
//#define lf Lf
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define endl "\n"
#define PII pair<int,int>
#define Gheap priority_queue<int,vector<int>,greater<int>>
#define Lheap priority_queue<int>
#define MAXN 0x3f3f3f3f
#define MINN -0x3f3f3f3f
using namespace std;
//const int N=1e6+100,M=2*N;
//int e[N],w[M],h[M],ne[M],idx;

struct pair_hash
{
    template <class T1, class T2>
    std::size_t operator() (const std::pair<T1, T2> &pair) const
    {
        return std::hash<T1>()(pair.first) ^ std::hash<T2>()(pair.second);
    }
};

unordered_map<int,vector<int>> v,w;
unordered_map<int,int> mpA,mpB,mp;
unordered_map<PII,int,pair_hash> st;
int nn,mm;
int ans,num;
int n,m,fg=0;
void dfsA(int cur)
{
	if(cur==n) fg=1;
	mpA[cur]++;
	for(auto z:v[cur])
	{
		if(mpA[z]==0)
		{
			dfsA(z);
		}
	}
}

void dfsB(int cur)
{
	mpB[cur]++;
	if(mpA[cur]) mp[cur]++;
	for(auto z:w[cur])
	{
		if(mpB[z]==0)
		{
			//if(st[{z,cur}]) mm++;
			dfsB(z);
		}
	}
}

/*
*/
void solve()
{
	cin>>n>>m;

	for(int i=1;i<=m;i++)
	{
		int a,b;
		cin>>a>>b;
		v[a].pb(b);
		st[{a,b}]++;
		w[b].pb(a);
	}

	dfsA(1);
	dfsB(n);

	if(fg==0)
	{
		cout<<0;
		return;
	}

	for(auto z:st)
	{
		if(mp.contains(z.fi.fi) and mp.contains(z.fi.se)) mm++;
	}
	//mm=st.size();

	nn=mp.size();
    cout<<mm-nn+2<<endl;
}
//5 9 16
//7 26 35
int main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int tt=1;
    //cin >> tt;
    while(tt--) solve();
}