100 10
87 73
15 71
14 33
1 4
20 80
65 67
36 36
25 4
22 21
7 97
 4 2
3 3
3 4
 5 4
3 3
4 4
5 5
1 2
 4 4
1 2
2 3
3 1
4 4
 4 3
1 1
2 3
3 4
 1000000 1
255765 255765
 4 3
1 2
2 3
4 4
 4 2
1 1
1 2
 3 3
1 1
2 2
3 3
 5 4
1 1
2 3
2 4
2 5
 4 5
1 4
3 4
1 2
2 3
2 4
 4 4
2 3
2 4
3 4
4 4
 10 9
8 10
3 10
2 8
9 3
4 8
1 10
7 9
5 4
7 3
 10 10
1 2
2 3
3 4
4 5
5 1
6 6
7 7
8 8
9 9
10 10
 5 5
1 4
3 4
1 2
2 3
2 4
 3 3
1 2
2 2
3 3
 5 3
1 1
2 2
3 3
 6 12
1 2
1 3
2 3
1 1
2 2
3 3
4 5
5 6
4 6
4 4
5 5
6 6
 4 4
1 2
2 3
1 3
4 4
 5 4
1 2
3 3
4 4
5 5
 7 13
6 7
2 7
3 7
4 3
5 2
1 4
7 7
3 1
5 5
3 3
1 5
2 6
6 6
 2 2
1 1
2 2
 5 5
1 1
2 2
3 3
4 4
5 5
 1 1
1 1
 7 3
1 1
3 3
6 6
 3 3
1 1
2 3
3 3

0 1 0 0 0 0 0 1 0 0 8 6 12 0 8 0 0 0 0 0 57 0 0 0 0 0
from collections import deque
ip = lambda : map(int, input().split())

def connected(g):
    f = [False for _ in range(len(g))]
    f[0] = True
    q = deque([0])
    while q:
        u = q.popleft()
        for v in g[u]:
            if not f[v]:
                f[v] = True
                q.append(v)
    for i in f:
        if not i:
            return False
    return True

n, m = ip()
ans = 0
g = [[] for _ in range(n)]
loops = 0
for i in range(m):
    u, v = ip()
    u -= 1
    v -= 1
    if u != v:
        g[v].append(u)
        g[u].append(v)
    else:
        loops += 1
if not connected(g):
    print(0)
else:
    for i in range(n):
        k = len(g[i])
        ans += k*(k - 1)//2 + k*loops
    ans += loops*(loops-1)//2
    print(ans)

