#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<vector<int>> adj(n + 1);
vector<vector<int>> radj(n + 1); // reverse graph for counting backward paths
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
// Function to count number of nodes reachable from start
auto bfs_count = [&](int start) {
vector<bool> visited(n + 1, false);
queue<int> q;
q.push(start);
visited[start] = true;
int count = 0;
while (!q.empty()) {
int node = q.front();
q.pop();
count++;
for (int neigh : adj[node]) {
if (!visited[neigh]) {
visited[neigh] = true;
q.push(neigh);
}
}
}
return count;
};
long long result = 0;
// For each node c, calculate the number of ways to pick s and f
// such that the simple path s -> c -> f exists.
// Since the graph is undirected and simple, a double counting using BFS counts suffices
for (int c = 1; c <= n; c++) {
// Count of nodes reachable from c (including c)
long long reachable_count = bfs_count(c);
// subtract 1 for c itself to count s and f distinct from c
if(reachable_count > 1)
result += (reachable_count - 1) * (reachable_count - 2);
// The formula counts combinations for s and f around c along paths.
}
cout << result << "\n";
return 0;
}
