#include<bits/stdc++.h>
using namespace std;
const int MAXN=2e5+5;
vector<int> ds[MAXN],vi[MAXN],node[MAXN];
int low[MAXN],num[MAXN],col[MAXN],sz[MAXN],sub[MAXN],tdfs=0,bcc=0,id=0;
bool joy[MAXN],ck[MAXN];
stack<int> st;
long long ans=0;
void dfs(int i,int pre)
{
int child=0;
low[i]=num[i]=++tdfs,st.push(i);
for(auto v:ds[i])
{
if(v==pre) continue;
if(!num[v])
{
dfs(v,i);
low[i]=min(low[i],low[v]),child++;
if(low[v]>=num[i])
{
joy[i]=(i!=pre||child>1),node[++bcc].push_back(i);
while(node[bcc].back()!=v) node[bcc].push_back(st.top()),st.pop();
}
}
else low[i]=min(low[i],num[v]);
}
}
void dftree(int i,int pre)
{
sub[i]=sz[i];
for(auto v:vi[i]) if(v!=pre)
{
dftree(v,i);
sub[i]+=sub[v];
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,m,cc=0;
cin>>n>>m;
for(int i=1;i<=m;i++)
{
int l,r;
cin>>l>>r;
ds[l].push_back(r),ds[r].push_back(l);
}
for(int i=1;i<=n;i++) if(!num[i]) dfs(i,i);
for(int i=1;i<=n;i++) if(joy[i]) col[i]=++id,sz[id]=1,ck[id]=true;
for(int i=1;i<=bcc;i++)
{
sz[++id]=node[i].size();
for(auto v:node[i]) if(!joy[v]) col[v]=id;
else vi[id].push_back(col[v]),vi[col[v]].push_back(id),sz[id]--;
}
for(int i=1;i<=id;i++)
{
dftree(i,i);
if(!ck[i])
{
long long sum=0;
for(auto v:vi[i]) ans+=sum*sub[v]*sz[i],sum+=sub[v];
ans+=1LL*sz[i]*max(0,sz[i]-1)/2*max(0,sub[i]-2);
}
else
{
long long sum=0;
for(auto v:vi[i])
{
ans+=sum*sub[v],sum+=sub[v];
if(!ck[v]) ans+=1LL*sz[v]*(sub[v]-sz[v])+1LL*sz[v]*(sz[v]-1)/2;
}
}
}
cout<<ans*2;
}
