#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pb push_back
#define faster ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
using ll = long long;
using ull = unsigned ll;
using ld = long double;
using pii = pair <int, int>;
using pil = pair <int, ll>;
using pli = pair <ll, int>;
using pll = pair <ll, ll>;
mt19937 Rand(chrono::steady_clock::now().time_since_epoch().count());
ll min(const ll &a, const ll &b){
return (a < b) ? a : b;
}
ll max(const ll &a, const ll &b){
return (a > b) ? a : b;
}
//const ll Mod = 1000000007;
//const ll Mod2 = 999999999989;
//only use when required
const int maxN = 1e5 + 1;
int n, m;
int low[maxN];
int num[maxN];
bool bridge[maxN];
int timedfs;
int id[maxN];
int scc;
struct TEdge{
int u, v, idx;
};
TEdge e[maxN];
vector <vector <TEdge>> adj;
vector <vector <pii>> adj1;
void pre_dfs(int u, int p){
low[u] = num[u] = ++timedfs;
for (auto i: adj[u]){
int v = i.v ^ i.u ^ u;
if (v == p) continue;
if (!num[v]){
pre_dfs(v, u);
low[u] = min(low[u], low[v]);
if (low[v] == num[v]) bridge[i.idx] = 1;
}
else low[u] = min(low[u], num[v]);
}
}
struct TDSU{
vector <pii> save;
vector <int> lab;
TDSU(){}
TDSU(int _n){
lab.resize(_n, -1);
}
inline void resize(int _n){
lab.resize(_n, -1);
}
inline int find_set(int u){
if (lab[u] < 0) return u;
return lab[u] = find_set(lab[u]);
}
inline int find(int u){
if (lab[u] < 0) return u;
return find(lab[u]);
}
inline void merge(int u, int v){
if (lab[u] > lab[v]) swap(u, v);
save.pb({v, lab[v]});
lab[u] += lab[v];
lab[v] = u;
}
inline void undo(){
int v = save.back().fi;
int u = lab[v];
lab[v] = save.back().se;
lab[u] -= lab[v];
save.pop_back();
}
inline void clear(){
lab.clear();
save.clear();
}
inline void reset(int _n){
clear();
resize(_n);
}
inline void roll_back(int _n){
while (save.size() > _n) undo();
}
};
TDSU dsu;
map <pii, bool> mp;
ll ans = 0;
bool vis[maxN];
int sz[maxN];
ll sumsz[maxN];
ll child[maxN];
int totalsz;
inline ll calc(ll x){
return x * (x - 1) * (x - 2);
}
inline ll cal(ll x){
return x * x;
}
void dfs(int u){
totalsz += sz[u];
vis[u] = 1;
for (pii i: adj1[u]){
if (vis[i.fi]) continue;
dfs(i.fi);
sumsz[u] += sumsz[i.fi];
}
sumsz[u] += sz[u];
ans += calc(sz[u]);
}
ll cnt[maxN];
void dfs1(int u, int p){
ll sum = 0;
for (pii i: adj1[u]){
if (i.fi == p) continue;
dfs1(i.fi, u);
child[u] += child[i.fi] + 1;
cnt[i.se] = 0;
}
for (pii i: adj1[u]){
if (i.fi == p) continue;
cnt[i.se] += child[i.fi] + 1;
}
for (pii i: adj1[u]){
if (i.fi == p) continue;
ans += (child[i.fi] + 1) * (cnt[i.se] - child[i.fi] - 1)
+ (child[i.fi] + 1) * sz[u] * (child[u] - cnt[i.se]);
}
ans += 2 * (totalsz - sz[u]) * cal(sz[u] - 1);
ans += 2 * sz[u] * (sumsz[u] - sz[u]) * (totalsz - sumsz[u]);
}
void Init(){
cin >> n >> m;
adj.resize(n + 1);
for (int i = 1; i <= m; ++i){
cin >> e[i].u >> e[i].v;
e[i].idx = i;
adj[e[i].u].pb({e[i].v, e[i].u, i});
adj[e[i].v].pb({e[i].u, e[i].v, i});
}
for (int i = 1; i <= n; ++i){
if (!num[i]){
pre_dfs(i, i);
}
}
dsu.resize(n + 1);
for (int i = 1; i <= m; ++i){
if (!bridge[i]){
int x = dsu.find_set(e[i].u);
int y = dsu.find_set(e[i].v);
if (x != y) dsu.merge(x, y);
}
}
for (int i = 1; i <= n; ++i){
int j = dsu.find_set(i);
if (!id[j]) id[j] = ++scc;
++sz[id[i] = id[j]];
}
adj1.resize(scc + 1);
for (int i = 1; i <= n; ++i){
for (auto _: adj[i]){
int j = _.v ^ _.u ^ i;
if (id[i] != id[j] && !mp[{id[i], id[j]}]){
mp[{id[i], id[j]}] = 1;
mp[{id[j], id[i]}] = 1;
adj1[id[i]].pb({id[j], i});
adj1[id[j]].pb({id[i], j});
}
}
}
for (int i = 1; i <= scc; ++i){
if (!vis[i]){
totalsz = 0;
dfs(i);
dfs1(i, i);
}
}
cout << ans;
}
#define debu
#define taskname "test"
signed main(){
if (fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
#ifdef debug
freopen(taskname".out", "w", stdout);
#endif
}
faster;
ll tt = 1;
//cin >> tt;
while (tt--){
Init();
}
if (fopen("timeout.txt", "r")){
ofstream timeout("timeout.txt");
timeout << 1000 * double(clock()) / CLOCKS_PER_SEC;
#ifndef debug
cerr << "\nTime elapsed: " << 1000 * double(clock()) / CLOCKS_PER_SEC << "ms\n";
#endif
}
}
