#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
#define int long long
#define mod 1000000007
#define base 7001
#define base2 757
#define F first
#define S second
// #define pi acos(-1)
#define double long double
// #define ordered_set tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update>
// #define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
// #pragma GCC optimize("O3,Ofast,unroll-loops")
// #pragma GCC target("avx2,sse3,sse4,avx")
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
constexpr int maxn = 1000001;
const int N = 1 << (int)(ceil(log2(maxn)));
int n, m, sz[maxn], c[maxn], ans[maxn];
vector<int> adj[maxn];
bool vis[maxn];
void calc(int v) {
vis[v] = 1;
for (int u : adj[v]) {
if (!vis[u]) {
calc(u);
sz[v] += sz[u] + 1;
c[v] += c[u] + sz[u];
}
}
}
void dfs(int v) {
vis[v] = 1;
// cout << v << ' ' << ans[v] << ' ' << c[v] << ' ' << sz[v] << '\n';
for (int u : adj[v]) {
if (!vis[u]) {
// ans[u] = c[v] - sz[u];
c[u] += (c[v] - c[u] - sz[u]) + (sz[v] - sz[u] - 1);
sz[u] = sz[v];
dfs(u);
}
}
}
signed main()
{
cin.tie(0) -> sync_with_stdio(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v; cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
for (int i = 1; i <= n; i++) if (!vis[i]) calc(i);
memset(vis, 0, sizeof vis);
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
// ans[i] = c[i];
dfs(i);
}
}
int sum = 0;
for (int i = 1; i <= n; i++) sum += c[i];
cout << sum;
}
