#include <bits/stdc++.h>
using namespace std;
using ll = long long;
inline void fastio() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
}
ll n, m, ans;
ll parent[101010], cnt[101010];
bool vst[101010];
vector<ll> gr[101010];
queue<ll> q;
ll Find(ll x) {
if (x == parent[x]) {
return x;
} else {
return parent[x] = Find(parent[x]);
}
}
void Union(ll x, ll y) {
x = Find(x), y = Find(y);
if (x != y) parent[y] = x;
}
int main() {
fastio();
cin >> n >> m;
for (ll i = 0, a, b; i < m; i++) {
cin >> a >> b;
gr[a].emplace_back(b);
}
for (ll i = 1; i <= n; i++) {
parent[i] = i;
}
for (ll i = 1; i <= n; i++) {
if (vst[i] or gr[i].size() < 2) continue;
q.emplace(i);
ll tmp = gr[i].front();
while (!q.empty()) {
ll loc = q.front();
q.pop();
for (auto& x : gr[loc]) {
if (!vst[loc]) {
vst[x] = true;
Union(tmp, x);
q.emplace(x);
}
}
}
}
for (ll i = 1; i <= n; i++) {
if (vst[i]) {
cnt[Find(i)]++;
} else {
ans += gr[i].size();
}
}
for (ll i = 1; i <= n; i++) {
ans += cnt[i] * (cnt[i] - 1);
}
cout << ans;
return 0;
}
