#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

int main() {
    ll N, M;
    cin >> N >> M;
    vector<ll> B(M);
    vector<ll> C(M);
    for (ll i = 0; i < M; i++) {
        cin >> B[i] >> C[i];
    }
    map<ll, ll> mp;
    ll now = 0;
    for (ll i = 0; i < M; i++) {
        mp[B[i]]++;
        mp[C[i]]++;
    }
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        itr->second = now;
        now++;
    }
    vector<ll> rev(now);
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        rev[itr->second] = itr->first;
    }
    scc_graph graph(now);
    // SCC して末端から順番に dp することで最終的な値がわかりそう
    for (ll i = 0; i < M; i++) {
        graph.add_edge(mp[B[i]], mp[C[i]]);
    }
    vector<vector<int>> sgraph = graph.scc();
    ll len = sgraph.size();
    vector<ll> belong(now);
    for (ll i = 0; i < len; i++) {
        for (ll x : sgraph[i]) {
            belong[x] = i;
        }
    }
    // 連結成分ごとにまとめたグラフを作る
    vector<vector<ll>> mgraph(len, vector<ll>(0));
    for (ll i = 0; i < M; i++) {
        if (belong[mp[B[i]]] != belong[mp[C[i]]]) {
            mgraph[belong[mp[B[i]]]].push_back(belong[mp[C[i]]]);
        }
    }
    vector<ll> dp(len, 0);
    // とりあえず max でまとめておく
    for (ll i = 0; i < len; i++) {
        for (ll x : sgraph[i]) {
            dp[i] = max(dp[i], rev[x]);
        }
    }
    for (ll i = len - 1; i >= 0; i--) {
        for (ll x : mgraph[i]) {
            dp[i] = max(dp[i], dp[x]);
        }
    }
    ll ans = N * (N + 1) / 2;
    ll all_sum = 0;
    for (ll i = 0; i < now; i++) {
        all_sum += rev[i];
    }
    ans -= all_sum;
    for (ll i = 0; i < len; i++) {
        ans += (ll)sgraph[i].size() * dp[i];
    }
    cout << ans << endl;
}