#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N,M;
map<int,vector<int>> G;
map<int,int> ma;

int dfs(int cur) {
	if(ma.count(cur)) {
		if(ma[cur]==-1) ma[cur]=cur;
		return ma[cur];
	}
	
	ma[cur]=-1;
	int ret=cur;
	FORR(v,G[cur]) ret=max(ret,dfs(v));
	return ma[cur]=ret;
	
	
}


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	FOR(i,M) {
		cin>>x>>y;
		G[x].push_back(y);
	}
	
	FORR(g,G) dfs(g.first);
	FORR(g,G) dfs(g.first);
	
	ll ret=1LL*N*(N+1)/2;
	FORR(m,ma) ret+=m.second-m.first;
	cout<<ret<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}