/*
Code written by Talant I.D.
*/
#include <bits/stdc++.h>
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
//~ typedef tree <int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
//~ #define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
const int mod = 1e9+7;
ll mode(ll a) {
while (a < 0) {
a += mod;
}
return a % mod;
}
ll subt(ll a, ll b) {
return mode(mode(a)-mode(b));
}
ll add(ll a, ll b) {
return mode(mode(a)+mode(b));
}
ll mult(ll a, ll b) {
return mode(mode(a)*mode(b));
}
ll binpow(ll a, ll b) {
ll res = 1;
while (b) {
if (b&1) res = mult(res, a);
a = mult(a, a);
b >>= 1;
}
return res;
}
const int N = 1e5+7;
vector <int> graph[N], comps_graph[N], stacc;
int timer, fup[N], tin[N], used[N];
ll ans, subtree[N];
int n, m, compsn = 1, in_n;
void find_artpoints(int v, int p = -1) {
used[v] = 1;
stacc.pb(v);
in_n++;
tin[v] = fup[v] = ++timer;
for (auto to : graph[v]) {
if (to == p) {
continue;
}
if (used[to]) {
fup[v] = min(fup[v], tin[to]);
}
else {
find_artpoints(to, v);
fup[v] = min(fup[v], fup[to]);
if (fup[to] >= tin[v]) {
comps_graph[v].pb(n+compsn);
while (!sz(comps_graph[n+compsn]) || comps_graph[n+compsn].back() != to) {
comps_graph[n+compsn].pb(stacc.back());
stacc.pop_back();
}
compsn++;
}
}
}
}
void dfs2(int v, int p = -1) {
subtree[v] = (v <= n);
for (auto to : comps_graph[v]) {
if (to == p) {
continue;
}
dfs2(to, v);
subtree[v] += subtree[to];
if (v > n) {
ans -= sz(comps_graph[v])*subtree[to]*(subtree[to]-1);
}
}
if (v > n) {
ans -= sz(comps_graph[v])*(in_n-subtree[v])*(in_n-subtree[v]-1);
}
}
int main() {
do_not_disturb
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
graph[x].pb(y);
graph[y].pb(x);
}
for (int i = 1; i <= n; i++) {
if (!used[i]) {
in_n = 0;
find_artpoints(i);
ans += in_n*(in_n-1)*(in_n-2);
dfs2(i);
}
}
cout << ans;
return 0;
}
