#include <bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 const int MAXN = ;

 int n, m;

 namespace Graph {

     int head[MAXN], nxt[MAXN<<], to[MAXN<<], eidx;

     void init() {

         eidx = ;

         memset( head, -, sizeof(head) );

     }

     void adde( int u, int v ) {

         to[eidx] = v, nxt[eidx] = head[u], head[u] = eidx++;

     }

 }

 bool ing[MAXN] = {}, vis[MAXN] = {}; // ing表示这个点是否存在于图中，因为题目只要求边互相联通，所以对于没有度数的点可以看做不存在

 queue<int> q;

 bool bfs() { // bfs判联通

     using namespace Graph;

     for( int i = ; i <= n; ++i )

         if( ing[i] ) {

             q.push(i), vis[i] = true;

             break;

         }

     while( !q.empty() ) {

         int u = q.front(); q.pop();

         for( int i = head[u]; ~i; i = nxt[i] ) {

             int v = to[i];

             if( vis[v] ) continue;

             q.push(v), vis[v] = true;

         }

     }

     for( int i = ; i <= n; ++i )

         if( ing[i] && !vis[i] )

             return false;

     return true;

 }

 int deg[MAXN] = {}, loop = ; // 每个点的度数（不含自环）和总的自环数量

 int main() {

     scanf( "%d%d", &n, &m );

     Graph::init();

     for( int i = ; i < m; ++i ) {

         int u, v; scanf( "%d%d", &u, &v );

         ing[u] = ing[v] = true;

         if( u != v ) {

             Graph::adde(u,v), ++deg[u];

             Graph::adde(v,u), ++deg[v];

         } else { // 自环

             Graph::adde(u,v), ++loop;

         }

     }

     if( !bfs() || m <  ) {

         puts("");

         return ;

     }

     ll ans = (ll)loop*(m-loop) + (ll)loop*(loop-)/; // 选一个自环和一个非自环，或者选两个自环

     for( int i = ; i <= n; ++i )

         ans += (ll)deg[i]*(deg[i] - )/; // 选两个非自环，且交于同一点的边

     cout << ans << endl;

     return ;

 }