#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define f first
#define s second
#define endl "\n"
const int N = 2e5 + 5, mod = 1e9 + 7; //!
int t, h[N], vis[N], x[N], p[N], sz[N], ans;
vector<int> V[N], adj[N], v;
void dfs0(int u,int p) {
h[u] = h[p] + 1; v.push_back(u);
vis[u] = 1;
for(int i = 0; i < V[u].size(); i++) {
if(V[u][i] == p) continue;
if(!vis[V[u][i]]) dfs0(V[u][i], u);
else if(h[V[u][i]] < h[u]) x[u]++, x[V[u][i]]--;
}
}
int find(int u) {
return (p[u] == u ? p[u] : p[u] = find(p[u]));
}
void merge(int u,int v) {
u = find(u), v = find(v);
p[v] = u;
sz[u] += sz[v];
sz[v] = 0;
}
void dfs(int u,int p) {
vis[u] = 1;
for(int i = 0; i < V[u].size(); i++) {
if(V[u][i] == p) continue;
if(!vis[V[u][i]]) dfs(V[u][i], u), x[u] += x[V[u][i]];
}
if(x[u]) merge(p, u);
}
void dfs2(int u, int p) {
vis[u] = 1;
int xx = sz[u];
for(int i = 0; i < adj[u].size(); i++) {
if(adj[u][i] == p) continue;
dfs2(adj[u][i], u);
sz[u] += sz[adj[u][i]];
ans -= sz[adj[u][i]] * (sz[adj[u][i]] - 1) * xx;
ans -= sz[adj[u][i]] * (xx - 1) * 2;
}
ans -= (v.size() - sz[u]) * (v.size() - sz[u] - 1) * xx;
ans -= (v.size() - sz[u]) * (xx - 1) * 2;
}
main() {
// ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
int n, m;
cin >> n >> m;
for(int i = 2; i <= m + 1; i++) {
int u, v;
cin >> u >> v;
V[u].push_back(v);
V[v].push_back(u);
}
for(int i = 1; i <= n; i++) p[i] = i, sz[i] = 1;
ans = 0;
for(int i = 1; i <= n; i++) {
v.clear();
if(vis[i]) continue;
dfs0(i, 0);
for(int j = 0; j < v.size(); j++) vis[v[j]] = 0;
dfs(i, 0);
for(int j = 0; j < v.size(); j++) {
int u = v[j];
for(int k = 0; k < V[u].size(); k++) {
if(find(V[u][k]) <= find(u)) continue;
adj[find(u)].push_back(find(V[u][k]));
adj[find(V[u][k])].push_back(find(u));
}
}
for(int j = 0; j < v.size(); j++) vis[v[j]] = 0;
ans += (int)v.size() * ((int)v.size() - 1) * ((int)v.size() - 2);
for(int j = 0; j < v.size();j++) {
if(v[j] == find(v[j]) && !vis[v[j]]) {
dfs2(v[j], 0);
}
}
for(int j = 0; j < v.size(); j++) vis[v[j]] = 1;
}
cout << ans;
}
