//khodaya khodet komak kon
# include <bits/stdc++.h>
/*
// ordered_set
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
# define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
*/
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef pair <pii, int> ppi;
typedef pair <int, pii> pip;
typedef pair <pii, pii> ppp;
typedef pair <ll, ll> pll;
# define A first
# define B second
# define endl '\n'
# define sep ' '
# define all(x) x.begin(), x.end()
# define kill(x) return cout << x << endl, 0
# define SZ(x) int(x.size())
# define lc id << 1
# define rc id << 1 | 1
# define InTheNameOfGod ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
ll power(ll a, ll b, ll md) {return (!b ? 1 : (b & 1 ? a * power(a * a % md, b / 2, md) % md : power(a * a % md, b / 2, md) % md));}
const int xn = 2e5 + 10;
const int xm = - 20 + 10;
const int sq = 320;
const int inf = 1e9 + 10;
const ll INF = 1e18 + 10;
const int mod = 998244353;
const int base = 257;
int n, m, sz[xn], par[xn], P[xn], H[xn];
int f[xn], sz2[xn], sum[xn];
pii E[xn];
ll ans;
vector <int> adj[xn], vec, mlf[xn];
vector <pip> G[xn];
bool mark[xn];
int get_root(int v){
if (v == P[v])
return v;
return P[v] = get_root(P[v]);
}
void merge(int v, int u){
v = get_root(v);
u = get_root(u);
if (v == u)
return;
if (sz[v] < sz[u])
swap(v, u);
P[u] = v;
sz[v] += sz[u];
if (H[f[u]] < H[f[v]])
f[v] = f[u];
}
void DFS(int v){
mark[v] = true;
sz2[v] = 1;
for (int u : adj[v]){
if (mark[u]){
if (H[u] >= H[v] || u == par[v])
continue;
int res = v;
while (get_root(res) != get_root(u)){
res = get_root(res);
merge(f[res], par[f[res]]);
}
continue;
}
H[u] = H[v] + 1;
par[u] = v;
DFS(u);
sz2[v] += sz2[u];
}
}
void DFS2(int v, int s, int id, int p = - 1){
sz2[v] = sz[v];
for (pip u : G[v]){
if (u.A == p)
continue;
DFS2(u.A, s, u.B.B, v);
sz2[v] += sz2[u.A];
sum[u.B.A] += sz2[u.A];
ans -= 1LL * sz2[u.A] * (sz2[u.A] - 1);
}
sum[id] += s - sz2[v];
ans -= 1LL * (s - sz2[v]) * (s - sz2[v] - 1);
for (int u : mlf[v])
ans -= 1LL * sum[u] * (sum[u] + 1) * (sz[v] - 1);
}
int main(){
InTheNameOfGod;
cin >> n >> m;
for (int i = 0; i < m; ++ i){
int v, u;
cin >> v >> u;
adj[v].push_back(u);
adj[u].push_back(v);
E[i] = {v, u};
}
for (int i = 1; i <= n; ++ i){
P[i] = f[i] = i;
sz[i] = 1;
}
for (int i = 1; i <= n; ++ i){
if (mark[i])
continue;
DFS(i);
vec.push_back(i);
}
for (int i = 0; i < m; ++ i){
int pv = E[i].A, pu = E[i].B;
int v = get_root(pv);
int u = get_root(pu);
if (v == u)
continue;
G[v].push_back({u, {pv, pu}});
G[u].push_back({v, {pu, pv}});
}
for (int i = 1; i <= n; ++ i)
mlf[get_root(i)].push_back(i);
for (int v : vec)
ans += 1LL * sz2[v] * (sz2[v] - 1) * (sz2[v] - 2), DFS2(get_root(v), sz2[v], 0);
cout << ans << endl;
return 0;
}
