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 array import array

n,m = [int(x) for x in raw_input().split()]
cnt = [0] * n
g = [array('i') for i in range(n)]
loop = 0
seen = [0]* n

def dfs(i, p = -1):
    seen[i] = 1
    for j in g[i]:
        if j != p and seen[j] == 0:
            dfs(j,i)

for i in range(m):
    a,b = [int(x) for x in raw_input().split()]
    a -= 1
    b -= 1
    if a == b:
        loop += 1
    else:
        g[a].append(b)
        g[b].append(a)
        cnt[a] += 1
        cnt[b] += 1

dfs(0)
res = 0
for i in range(n):
    res += (cnt[i] * (cnt[i] -1))/2
    if seen[i] == 0:
        res = 0
        break

res += loop * (m - 1)
res -= (loop * (loop -1))/2

print res
