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
n, m = map(int, raw_input().split())
E = []
P = [0] * n

# Adjacency list
AL = []
for i in range(n):
    AL += [[]]

for i in range(m):
    edge = map(int, raw_input().split())
    P[edge[0]-1] += 1
    P[edge[1]-1] += 1
    AL[edge[0]-1] += [edge[1]-1]
    AL[edge[1]-1] += [edge[0]-1]
    E += [edge]
    
def main():

    visible = [0] * n

    def dfs(v):
        visible[v] = 1

        for v2 in AL[v]:
            if not visible[v2]:
                dfs(v2)

    dfs(0)

    if sum(visible) < n:
        return 0
    
    sumP = 0
    for edge in E:
        sumP += P[edge[0]-1] - 2 + (P[edge[1]-1] if edge[0] != edge[1] else 0)
        
    return sumP / 2

print main()