#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 1e5 + 10;
int n, m;
vector <int> e[N], g[N];
vector <int> stk;
int num[N], low[N], ti, cnt, comp[N], a[N], sz[N];
long long ans;
void dfs(int u, int p) {
num[u] = low[u] = ++ti;
stk.push_back(u);
for (auto v: g[u]) {
if (v == p) continue;
if (!num[v]) {
dfs(v, u);
low[u] = min(low[u], low[v]);
} else low[u] = min(low[u], num[v]);
}
if (low[u] != num[u]) return;
++cnt;
int sz = 0;
while (1) {
int v = stk.back();
stk.pop_back();
comp[v] = cnt;
e[v].push_back(cnt + n);
e[cnt + n].push_back(v);
++sz;
if (u == v) break;
}
// ans += 1LL * sz * (sz - 1) * (sz - 2);
}
int init(int u, int p) {
int ans = (u <= n);
for (auto v: e[u]) {
if (v == p) continue;
ans += init(v, u);
}
return ans;
}
void solve(int u, int p, int m) {
sz[u] = (u <= n);
for (auto v: e[u]) {
if (v == p) continue;
solve(v, u, m);
sz[u] += sz[v];
}
int cur = m - sz[u];
for (auto v: e[u]) {
if (v == p) continue;
ans += 2LL * sz[v] * cur;
cur += sz[v];
}
}
int main() {
ios :: sync_with_stdio(0); cin.tie(0);
cin >> n >> m;
while (m--) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
for (int i = 1; i <= n; ++i) if (!num[i]) dfs(i, 0);
for (int u = 1; u <= n; ++u)
for (auto v: g[u])
if (comp[u] != comp[v])
e[u].push_back(v);
for (int i = 1; i <= n; ++i) if (!sz[i]) {
int m = init(i, 0);
solve(i, 0, m);
}
cout << ans;
}
/*
15 12
6 7
7 8
8 6
8 9
9 10
10 11
11 12
12 9
8 13
13 14
14 15
15 13
*/
