#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
namespace mydef {
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
bool dbg = false;
}  // namespace mydef
using namespace mydef;
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
#define pi pair<int, int>
#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define asn ans

int N, M;
set<P> G[101010];
int seen[101010];

void solve() {
    int ans = 0;
    for (int i = 0; i < N; i++) {
        if (seen[i])
            continue;
        queue<int> que;
        que.push(i);
        bool reverse = false;
        map<int, int> mp;
        set<int> All;
        set<P> edge;
        mp[i] = 0;
        All.insert(i);
        while (!que.empty()) {
            auto x = que.front();
            que.pop();
            if (seen[x])
                continue;
            seen[x] = 1;
            int now = mp[x];
            for (auto& p : G[x]) {
                int y = p.first;
                int dir = p.second;
                if (dir == 1)
                    edge.insert(make_pair(x, y));
                else
                    edge.insert(make_pair(y, x));
                if (mp.count(y)) {
                    if (mp[y] != (now + dir + 3) % 3) {
                        reverse = true;
                    }
                } else {
                    mp[y] = (now + dir + 3) % 3;
                    All.insert(y);
                    que.push(y);
                }
            }
        }
        if (reverse) {
            ans += All.size() * All.size();
        } else {
            int cnt[3] = {};
            for (auto& p : mp) {
                cnt[p.second]++;
            }
            sort(cnt, cnt + 3);
            if (cnt[0] == 0) {
                ans += edge.size();
            } else {
                for (int i = 0; i < 3; i++) {
                    ans += cnt[i] * cnt[(i + 1) % 3];
                }
            }
        }
    }
    cout << ans << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    cin >> N >> M;
    while (M--) {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        G[a].insert(make_pair(b, 1));
        G[b].insert(make_pair(a, -1));
    }

    solve();
    return 0;
}


Measured memory_bytes: 39664