//
// Created by yamunaku on 2020/08/22.
//

#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < (n); i++)
#define repl(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) for(int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(),(x).end()
#define MOD9 998244353
#define MOD1 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
#define SP <<" "<<
#define CYES cout<<"Yes"<<endl
#define CNO cout<<"No"<<endl
#define CFS cin.tie(0);ios::sync_with_stdio(false)
#define CST(x) cout<<fixed<<setprecision(x)

using ll = long long;
using ld = long double;
using vi = vector<int>;
using mti = vector<vector<int>>;
using vl = vector<ll>;
using mtl = vector<vector<ll>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
template<typename T>
using heap = priority_queue<T, vector<T>, function<bool(const T, const T)>>;

map<int, vector<int>> e;
map<int, vector<int>> ne;
map<int, int> id;
map<int, int> col;

void dfs(int x, int &num){
    id[x] = -1;
    for(auto &nx : e[x]){
        if(id.find(nx) == id.end()){
            dfs(nx, num);
        }
    }
    id[x] = num++;
}

void dfs2(int x, int c){
    col[x] = c;
    for(auto &nx : ne[x]){
        if(col.find(nx) == col.end()){
            dfs2(nx, c);
        }
    }
}

int main(){
    CFS;
    ll n;
    int m;
    cin >> n >> m;
    vi b(m), c(m);
    rep(i, m){
        cin >> b[i] >> c[i];
        e[b[i]].push_back(c[i]);
        ne[c[i]].push_back(b[i]);
    }
    int sz = 0;
    for(auto &p:e){
        if(id.find(p.first) == id.end()){
            dfs(p.first, sz);
        }
    }
    ll ans = n * (n + 1) / 2;
    vi a(sz);
    map<int, int> ma;
    for(auto &p : id){
        a[p.second] = p.first;
        ans -= p.first;
    }
    per(i, sz){
        if(col.find(a[i]) == col.end()){
            dfs2(a[i], a[i]);
        }
    }
    rep(i, sz){
        ma[col[a[i]]] = max(ma[col[a[i]]], a[i]);
    }
    map<int, vector<int>> ee;
    rep(i, m){
        ee[col[b[i]]].push_back(col[c[i]]);
    }
    set<int> f;
    rep(i, sz){
        int cc = col[a[i]];
//        if(f.find(cc) != f.end()) continue;
//        f.insert(cc);
//        for(auto &nx : ee[cc]){
//            ma[cc] = max(ma[cc], ma[nx]);
//        }
    }
    rep(i, sz){
        ans += ma[col[a[i]]];
    }
    cout << ans << endl;
    return 0;
}