#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
// ---------- END OF TEMPLATE ----------
vi adjList[100000];
int disc[100000],low[100000],art[100000],t[100000];
vpii S;
vi com[100000];
int num = 0,bcc = 0;
int doDFS(int u,int p) {
int i,c = 0;
disc[u] = low[u] = num++;
for (i = 0; i < adjList[u].size(); i++) {
int v = adjList[u][i];
if (disc[v] == -1) {
c++;
S.pb(mp(u,v));
doDFS(v,u);
low[u] = min(low[u],low[v]);
if (((p == -1) && (c > 1)) || ((p != -1) && (low[v] >= disc[u]))) {
art[u] = 1;
while (1) {
int uu = S.back().first,vv = S.back().second;
S.pop_back();
if (t[uu] != bcc+1) com[bcc].pb(uu),t[uu] = bcc+1;
if (t[vv] != bcc+1) com[bcc].pb(vv),t[vv] = bcc+1;
if ((uu == u) && (vv == v)) break;
}
bcc++;
}
}
else if ((v != p) && (disc[v] < disc[u])) low[u] = min(low[u],disc[v]),S.pb(mp(u,v));
}
return 0;
}
LLI ans = 0;
int size[100000];
vi adjList2[200000];
int visited[200000],sub[200000];
int doDFS2(int u,int p) {
int i;
sub[u] = ((u < bcc) ? size[u]:0);
visited[u] = 1;
for (i = 0; i < adjList2[u].size(); i++) {
int v = adjList2[u][i];
if (v != p) sub[u] += doDFS2(v,u);
}
return sub[u];
}
int doDFS3(int u,int p,int r) {
int i;
int c = sub[r]-sub[u];
if (u < bcc) ans += 2LL*size[u]*size[u]*(sub[r]-size[u]);
for (i = 0; i < adjList2[u].size(); i++) {
int v = adjList2[u][i];
if (v != p) {
doDFS3(v,u,r);
if (u < bcc) ans += 2LL*size[u]*sub[v]*c,c += sub[v];
}
}
return 0;
}
int main() {
int i;
int n,m,u,v;
scanf("%d %d",&n,&m);
for (i = 0; i < m; i++) {
scanf("%d %d",&u,&v);
u--,v--;
adjList[u].pb(v);
adjList[v].pb(u);
}
int j;
for (i = 0; i < n; i++) disc[i] = low[i] = -1;
for (i = 0; i < n; i++) {
if (disc[i] == -1) {
doDFS(i,-1);
if (!S.empty()) {
while (!S.empty()) {
int u = S.back().first,v = S.back().second;
S.pop_back();
if (t[u] != bcc+1) com[bcc].pb(u),t[u] = bcc+1;
if (t[v] != bcc+1) com[bcc].pb(v),t[v] = bcc+1;
}
bcc++;
}
}
}
for (i = 0; i < bcc; i++) {
for (j = 0; j < com[i].size(); j++) {
if (art[com[i][j]]) {
adjList2[i].pb(com[i][j]+bcc);
adjList2[com[i][j]+bcc].pb(i);
}
}
size[i] = com[i].size()-1;
ans += (LLI) (size[i]+1)*size[i]*(size[i]-1);
ans += (LLI) size[i]*size[i];
}
for (i = 0; i < bcc; i++) {
if (!visited[i]) {
doDFS2(i,-1),doDFS3(i,-1,i);
ans -= (LLI) sub[i]*sub[i];
}
}
printf("%lld\n",ans);
return 0;
}
