#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
int n,m;
vector <int> adj[maxn];
stack <int> st;
int l[maxn],t[maxn],cnt,scc,id[maxn];
int dp[maxn],dp2[maxn],s[maxn];
vector <int> adj2[maxn];
int ans = 0LL;
bool dau[maxn];
void dfs(int x, int p)
{
st.push(x);
l[x] = t[x] = ++cnt;
for (int i:adj[x])
if (i!=p)
{
if (!t[i])
{
dfs(i,x);
l[x]=min(l[x],l[i]);
}
else l[x]=min(l[x],t[i]);
}
if (l[x]==t[x])
{
scc++; int temp;
do
{
temp = st.top(); st.pop();
s[scc]++;
id[temp] = scc;
}
while (temp!=x);
}
}
void dfs2(int x, int p)
{
dp[x] = 0;
for (int i:adj2[x])
if (i!=p)
{
dfs2(i,x);
// cout<<temp<<" : "<<dp[i]+s[i]<<' '<<s[x]<<endl;
dp[x] = (dp[x] + dp[i] + s[i]) ;
}
}
void dfs3(int x, int p, int val)
{
dp2[x] = val;
// cout<<val<<" : "<<temp<<" : "<<s[x]<<endl;
vector <int> pre,suf;
for (int i:adj2[x])
if (i!=p)
{
pre.push_back((dp[i]+s[i]) );
suf.push_back((dp[i]+s[i]) );
}
val = (val + s[x]) ;
// cout<<x<<" :: "<<val<<endl;
// for (int i:pre) cout<<i<<' '; cout<<"@@@@@@@@@@@"<<endl;
// for (int i:suf) cout<<i<<' '; cout<<"@@@@@@@@@@@"<<endl;
for (int i=1; i<pre.size(); i++) pre[i] = (pre[i-1] + pre[i]) ;
for (int i=suf.size()-2; i>=0; i--) suf[i] = (suf[i+1] + suf[i]) ;
// cout<<(int)suf.size()<<"@%$@%#$@"<<endl;
int cnt2=0;
for (int i:adj2[x])
if (i!=p)
{
int val2 = val;
// cerr<<val2<<' '<<cnt2<<" -> ";
if (cnt2>0) val2 = (val2 + pre[cnt2-1]) ;
if (cnt2<=(int)suf.size()-2) val2 = (val2 + suf[cnt2+1]) ;
// cerr<<val<<endl;
cnt2++;
dfs3(i,x,val2);
}
}
void dfs4(int x, int p, int sz)
{
int val = dp2[x];
int temp = (sz - s[x] - val);
if (temp>0&&val>0)
ans += s[x]*val*temp;
for (int i:adj2[x])
if (i!=p)
{
dfs4(i,x,sz);
val = dp[i]+s[i];
temp = sz - s[x] - val;
if (temp>0&&val>0) ans+=s[x]*val*temp;
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
// freopen("dualthon.inp","r",stdin);
// freopen("dualthon.ans","w",stdout);
cin>>n>>m;
for (int i=1; i<=m; i++)
{
int u,v; cin>>u>>v;
adj[u].push_back(v);
adj[v].push_back(u);
}
cnt = scc= 0;
vector <int> root;
for (int i=1; i<=n; i++) if (!t[i]) dfs(i,i), root.push_back(id[i]);
for (int i=1; i<=n; i++)
for (int j:adj[i])
if (id[i]!=id[j])
{
adj2[id[i]].push_back(id[j]);
}
for (int i=1; i<=scc; i++)
{
sort(adj2[i].begin(),adj2[i].end());
adj2[i].resize(unique(adj2[i].begin(),adj2[i].end())-adj2[i].begin());
}
for (int i:root) dfs2(i,i);
for (int i:root) dfs3(i,i,0);
for (int i=1; i<=scc; i++)
{
int sl = s[i];
// cout<<i<<" := "<<dp[i]<<' '<<dp2[i]<<endl;
int temp = 0;
if (sl>=3)
{
temp = sl*(sl-1)*(sl-2);
ans = (ans + temp);
}
if (sl>=2)
{
temp = (sl-1)*(sl-1);
// cout<<temp<<" "<<dp[i]<<' '<<dp2[i]<<endl;
ans += temp*dp[i]*2;
ans += temp*dp2[i]*2;
}
}
for (int i:root) dfs4(i,i,dp[i]+s[i]);
cout<<ans<<'\n';
}
