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
g = []
used = []
e = 0
def dfs(v):
    global g
    global used
    global e
    used[v] = 1
    for to in g[v]:
        if not used[to]:
            dfs(to)
        e += 1

def main():
    global used
    global g
    global e
    (n, m) = map(int, input().split())
    used = [0] * (n + 1)
    g = [[] for i in range(n + 1)]
    loop = 0
    s = 0
    for i in range(m):
        (v, u) = map(int, input().split())
        if v == u:
            loop += 1
        else:
            g[v].append(u)
            s = v
    dfs(s)
    if e + loop != m:
        print(0)
    else:
        ans = 0
        for i in range(1, n + 1):
            sz = len(g[i])
            ans += sz * (sz - 1) // 2
        ans += loop * (loop - 1) // 2
        ans += (m - loop) * loop
        print(ans)

if __name__ == "__main__":
    main()
