#include<bits/stdc++.h>
#define pii pair<int,int>
#define f first
#define s second
#define ll long long
#define int long long
using namespace std;
const int N = 2e5 + 5;
int f[N], low[N], t[N], sz[2 * N], p[N], h[N];
ll bad = 0, s[2 * N];
int n;
vector<int> adj[2 * N];
vector<pii> V[N];
map<int,int> e[N];
int find(int u) {
return (p[u] == u ? u : p[u] = find(p[u]));
}
void merge(int u, int v) {
u = find(u), v = find(v);
p[u] = v;
}
void dfs0(int u, int ID) {
f[u] = 1;
low[u] = h[u]; sz[u] = 1;
for(int i = 0; i < V[u].size(); i++) {
int v = V[u][i].f, id = V[u][i].s;
if(ID == id) continue;
if(f[v]) low[u] = min(low[u], h[v]);
else {
t[id] = 1;
h[v] = h[u] + 1;
dfs0(v, id);
sz[u] += sz[v];
if(low[v] < h[u]) merge(ID, id);
low[u] = min(low[u], low[v]);
}
}
}
void dfs(int u, int p) {
h[u] = h[p] + 1;
sz[u] = 0;
s[u] = 0;
for(int i = 0; i < adj[u].size(); i++) {
int v = adj[u][i];
if(v == p) continue;
dfs(v, u);
s[u] += s[v] + sz[u] * sz[v];
sz[u] += sz[v];
}
if(h[u] % 2)s[u] += sz[u], sz[u]++;
if(h[u] == 3) bad += sz[u] * (sz[u] - 1) / 2;
}
void ADD(int x, int y) {
x += n;
if(e[x][y]) return;
e[x][y] = 1;
adj[x].push_back(y);
adj[y].push_back(x);
}
main() {
int m;
cin >> n >> m;
vector<pair<int,int >> e;
for(int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
V[u].push_back({v, i});
V[v].push_back({u, i});
e.push_back({u, v});
p[i] = i;
}
int all = 0;
for(int i = n; i >= 1; i--) if(!f[i]) dfs0(i, 0), all += sz[i] * (sz[i] - 1) * (sz[i] - 2);
// for(int i = 1; i <= n; i++) V[i].clear();
for(int i = 1; i <= m; i++) {
if(!t[i]) continue;
ADD(find(i), e[i - 1].f);
ADD(find(i), e[i - 1].s);
}
for(int i = 1; i <= n; i++)
dfs(i, 0);
cout << all - 2 * bad;
}
