//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 998244353;
struct DSU{
vector<int>rep, sz;
DSU(int n){
rep.assign(n+1, 0);
iota(rep.begin(), rep.end(), 0);
sz.assign(n+1, 1);
}
int f(int a){
return a == rep[a] ? a : rep[a] = f(rep[a]);
}
void u(int a, int b){
a = f(a); b = f(b);
if (a == b) return;
if (sz[a] < sz[b]) swap(a, b);
sz[a] += sz[b];
rep[b] = a;
}
};
void solve(){
int n, m; cin >> n >> m;//nikt nie powiedzial ze graf jest spojny xd
vector<vector<T>>g(n+1);
vector<T>edges;
vector<int>skip(m);
for (int i = 0; i<m; i++){
int a, b; cin >> a >> b;
g[a].emplace_back(b, i);
g[b].emplace_back(a, i);
edges.emplace_back(a, b);
}
vector<int>low(n+1), pre(n+1);
int tt = 0;
vector<bool>vis(n+1);
function<void(int, int)>dfs = [&](int v, int pa){
pre[v] = ++tt;
low[v] = pre[v];
vis[v] = 1;
for (auto [x, i]: g[v]){
if (x == pa) continue;
if (vis[x]){
low[v] = min(low[v], pre[x]);
} else {
// debug(v, x);
dfs(x, v);
low[v] = min(low[v], low[x]);
// debug(v, pre[v], low[x]);
if (pre[v] < low[x]){
debug(x, v, i);
skip[i] = 1;
}
}
}
};
for (int i = 1; i<=n; i++){
if (!vis[i]){
dfs(i, i);
}
}
DSU dsu(n+1);
for (int i = 0; i<m; i++){
if (!skip[i]){
dsu.u(edges[i].first, edges[i].second);
}
}
vector<vector<int>>G(n+1);
vector<int>sz(n+1);
for (int i = 0; i<m; i++){
if (!skip[i]) continue;
//most
auto [a, b] = edges[i];
a = dsu.f(a);b = dsu.f(b);
debug(a, b);
if (a != b){
G[a].emplace_back(b);
G[b].emplace_back(a);
}
// dsu.u(a, b);
}
vis.assign(n+1, 0);
function<void(int, int)>subsz = [&](int v, int pa){
sz[v] = dsu.sz[dsu.f(v)];
vis[v] = 1;
for (auto x: G[v]){
if (x == pa) continue;
subsz(x, v);
sz[v] += sz[x];
}
};
for (int i = 1; i<=n; i++){
if (dsu.f(i) == i && !vis[i]){
subsz(i, i);
}
}
debug(dsu.sz);
debug(sz);
int ans = 0;
vis.assign(n+1, 0);
int all = 0;
function<void(int, int)>dfessa = [&](int v, int pa){
int sq = 0, s = 0;
vis[v] = 1;
for (auto x: G[v]){
if (x == pa) continue;
dfessa(x, v);
sq += sz[x] * sz[x];
s += sz[x];
}
//do rodzica
int curr = dsu.sz[dsu.f(v)];
sq += (all-sz[v])*(all-sz[v]);
s = all-curr;
debug(v, s, sq, curr);
ans += 2 * curr * (s*s-sq)/2; //jeden znajduje sie tutaj
ans += 2 * (curr-2) * (curr-1) * s; //dwa znajduja sie w jednej spojnej
ans += 2 * s * (curr-1);
ans += curr * (curr-1) * (curr-2);
};
for (int i = 1; i<=n;i++){
if (dsu.f(i) == i && !vis[i]){
all = sz[i];
debug(i, all, ans);
dfessa(i, i);
}
}
debug(ans);
cout << ans << "\n";
}
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
//cin >> t;
while (t--) solve();
return 0;
}
