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
#!/usr/bin/pypy3

from sys import stdin,stderr
from collections import defaultdict

def readInts(): return map(int,stdin.readline().strip().split())
def print_err(*args,**kwargs): print(*args,file=stderr,**kwargs)

def count_pairs(g,n,m):
    parent = [ None for _ in range(n+1) ]
    parent[1] = 1
    remain = [1]
    while remain:
        node = remain.pop()
        for nn in g[node]:
            if parent[nn] is None:
                parent[nn] = node
                remain.append(nn)
    for ni in range(1,n+1):
        if parent[ni] is None: return 0
    out = 0
    for node in range(1,n+1):
        v = len(g[node])
        v *= v-1
        v //= 2
        out += v
    return out

def run():
    n,m = readInts()
    g = defaultdict(list)
    for _ in range(m):
        a,b = readInts()
        g[a].append(b)
        if a != b: g[b].append(a)
    print(count_pairs(g,n,m))
        
run()
