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
# IDEA: Split edges into 2 edges, try to remove edges such that euler tour remains
from math import log

n, m = map(int, input().split())

ranks = [0]*(n+1)
rep = list(range(0, n+1))
loops = 0

cities = set()

edges = []
for _ in range(0, m):
    edges.append(list(map(int, input().split())))

#edges = sorted(edges, key=lambda x: max(x[0], x[1]))

for a, b in edges:
    if a != b:
        ranks[a] += 1
        ranks[b] += 1
    else:
        loops += 1
    mab = min(rep[a], rep[b])
    rep[a] = mab
    rep[b] = mab
    cities.add(a)
    cities.add(b)
    #print(rep)

changed = True
while changed:
    changed = False
    for a, b in edges:
        if rep[a] < rep[b]:
            rep[b] = rep[a]
            changed = True
        if rep[b] < rep[a]:
            rep[a] = rep[b]
            changed = False

for x in cities:
    if rep[x] != 1:
        print(0)
        break
else:
    # count solution
    cnt = 0
    # for regular graph, can only walk two adjacent edges only once to maintain euler tour.
    for r in ranks:
        cnt += r * (r - 1)
    # each edge is remove two times
    cnt /= 2
    # for each removed loop remove any arbitrary other regular edge
    cnt += loops * (m - loops)
    # for each removed loop remove any arbitrary other loop (without doubles)
    cnt += loops * (loops - 1)  / 2

    print(int(cnt))

