#include <bits/stdc++.h>
using namespace std;
int n, m, nodes, vid, found;
vector<vector<int>> adj;
vector<int> vis;
long long ans;
void dfs (int u, int t, int k, bool ok = 0) {
if (found) {
return;
}
vis[u] = vid;
if (u == k) {
found = ok;
ans += ok;
}
ok |= u == t;
for (int v : adj[u]) {
if (vis[v] != vid) {
dfs(v, t, k, ok);
}
}
vis[u] = 0;
}
void dfs2 (int u) {
vis[u] = 1;
ans += nodes * 1LL * (nodes - 1) / 2;
++nodes;
for (int v : adj[u]) {
if (!vis[v]) {
dfs2(v);
}
}
}
int main (){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("SuhaibSawalha1","r",stdin);
cin >> n >> m;
adj.resize(n);
while (m--) {
int u, v;
cin >> u >> v, --u, --v;
adj[u].push_back(v);
adj[v].push_back(u);
}
vis.resize(n);
if (n <= 10) {
for (int u = 0; u < n; ++u) {
for (int v = 0; v < n; ++v) {
for (int k = 0; k < n; ++k) {
if (set<int>{u, v, k}.size() == 3) {
++vid;
found = 0;
dfs(u, v, k);
}
}
}
}
cout << ans;
return 0;
}
for (int u = 0; u < n; ++u) {
if (adj[u].size() == 1 && !vis[u]) {
nodes = 0;
dfs2(u);
}
}
cout << 2 * ans;
return 0;
}
