#line 1 "a.cpp"
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#line 1 "/home/kotatsugame/library/graph/SCC.cpp"
//Strongly Connected Components
#line 3 "/home/kotatsugame/library/graph/SCC.cpp"
struct SCC{
	int n;
	vector<int>comp,order;
	vector<bool>used;
	vector<vector<int> >G,RG;
	SCC(int _n=0):n(_n),comp(_n,-1),used(_n,false),G(_n),RG(_n){}
	void add_edge(int from,int to)
	{
		G[from].push_back(to);
		RG[to].push_back(from);
	}
	void copy(const vector<vector<int> >&H)
	{
		for(int i=0;i<H.size();i++)
		{
			for(int j=0;j<H[i].size();j++)
			{
				G[i].push_back(H[i][j]);
				RG[H[i][j]].push_back(i);
			}
		}
	}
	int operator[](int u)const{return comp[u];}
	void dfs(int u)
	{
		used[u]=true;
		for(int i=0;i<G[u].size();i++)if(!used[G[u][i]])dfs(G[u][i]);
		order.push_back(u);
	}
	void rdfs(int u,int cnt)
	{
		comp[u]=cnt;
		for(int i=0;i<RG[u].size();i++)if(comp[RG[u][i]]==-1)rdfs(RG[u][i],cnt);
	}
	int build()
	{
		for(int i=0;i<n;i++)if(!used[i])dfs(i);
		int cnt=0;
		for(int i=n-1;i>=0;i--)if(comp[order[i]]==-1)rdfs(order[i],cnt++);
		return cnt;
	}
	int build(vector<vector<int> >&H)
	{
		int ret=build();
		H.assign(ret,vector<int>());
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<G[i].size();j++)
			{
				if(comp[i]!=comp[G[i][j]])
					H[comp[i]].push_back(comp[G[i][j]]);
			}
		}
		return ret;
	}
};
#line 6 "a.cpp"
int N,M;
int B[2<<17],C[2<<17];
main()
{
	cin>>N>>M;
	vector<int>v(2*M);
	for(int i=0;i<M;i++)
	{
		cin>>B[i]>>C[i];
		v[i*2]=B[i];
		v[i*2+1]=C[i];
	}
	sort(v.begin(),v.end());
	v.erase(unique(v.begin(),v.end()),v.end());
	SCC P(v.size());
	for(int i=0;i<M;i++)
	{
		B[i]=lower_bound(v.begin(),v.end(),B[i])-v.begin();
		C[i]=lower_bound(v.begin(),v.end(),C[i])-v.begin();
		P.add_edge(B[i],C[i]);
	}
	vector<vector<int> >H;
	int K=P.build(H);
	vector<int>mx(K);
	for(int i=0;i<v.size();i++)mx[P[i]]=i;
	for(int i=K;i--;)
	{
		for(int v:H[i])mx[i]=max(mx[i],mx[v]);
	}
	long ans=(long)N*(N+1)/2;
	for(int i=0;i<v.size();i++)
	{
		ans-=v[i];
		ans+=v[mx[P[i]]];
	}
	cout<<ans<<endl;
}