#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define endl '\n'
#define ep insert
#define pow pwr
#define sqrt sqrtt
#define elif else if
#define y1 YONE
#define int long long
using namespace std;
const int N=1e6+5;
int n,m,sz[N],par[N],dpar[N],dsz[N];
vector<int> adj[N];
int getpar(int x){
if (x==dpar[x]) return x;
return dpar[x]=getpar(dpar[x]);
}
void link(int x,int y){
x=getpar(x);y=getpar(y);
if (x==y) return;
if (dsz[x]>dsz[y]) swap(x,y);
dpar[x]=y;
dsz[y]+=dsz[x];
return;
}
int getsize(int node,int p){
par[node]=p;
sz[node]=1;
for (auto u:adj[node]){
if (u==p) continue;
sz[node]+=getsize(u,node);
}return sz[node];
}
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
cin>>n>>m;
for (int i=1;i<=n;i++){
dsz[i]=1;
dpar[i]=i;
}
for (int i=1;i<=m;i++){
int x,y;
cin>>x>>y;
adj[x].pb(y);
adj[y].pb(x);
link(x,y);
}
for (int i=1;i<=n;i++){
if (sz[i]) continue;
getsize(i,0);
}
int ans=0;
for (int i=1;i<=n;i++){
int x=sz[i]-1;
for (auto u:adj[i]){
if (u==par[i]) continue;
x-=sz[u];
ans+=x*sz[u];
}ans+=(dsz[getpar(i)]-sz[i])*(sz[i]-1);
}
cout<<ans*2LL<<endl;
return 0;
}
