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
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Random;
import java.util.Set;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;
import java.util.Vector;
import java.util.regex.Matcher;
import java.util.regex.Pattern;



public class CF407B {

    static StringTokenizer st;
    static BufferedReader br;
    static PrintWriter pw;

    static class Sort implements Comparable<Sort> {
        int ind, a;

        @Override
        public int compareTo(Sort o) {
            return a - o.a;
        }
        public Sort(int i, int an) {
            ind = i;
            a = an;
        }
    }

    public static void main(String[] args) throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
        solve();
        pw.close();
    }

    static ArrayList<Integer>[] g;
    static int n, m;
    static int[] kol;
    static boolean[] used;
    private static void solve() throws IOException {
    	n = nextInt();
    	m = nextInt();
    	kol = new int [n];
    	g = new ArrayList[n];
    	for (int i = 0; i < n; ++i)
    		g[i] = new ArrayList<Integer>();
    	used = new boolean[n];
    	int u, v;
    	for (int i = 0; i < m; ++i) {
    		u = nextInt() - 1;
    		v = nextInt() - 1;
    		if (u == v) {
    			kol[u]++;
    		} else {
    			kol[u]++;
    			kol[v]++;
    			g[u].add(v);
    			g[v].add(u);
    		}
    	}
    	if (m < 2) {
    		pw.println(0);
    		return;
    	}	
    	for (int i = 0; i < n; ++i) {
    		if (kol[i] > 0) {
    			bfs(i);
    			break;
    		}
    	}
    	long ans = 0;
    	for (int i = 0; i < n; ++i) {
    		if (!used[i] && kol[i] > 0) {
    			pw.println(0);
    			return;
    		} else {
    			ans += (long) (kol[i]) * (kol[i] - 1) / 2;
    		}
    	}
    	pw.println(ans);
    }

	private static void bfs(int i) {
		int[] q = new int [n + 2];
		int h = 0, t = 0;
		used[i] = true;
		q[h++] = i;
		int u;
		while (h != t) {
			u = q[t++];
			for (int v : g[u]) {
				if (!used[v]) {
					used[v] = true;
					q[h++] = v;
				}
			}
		}
	}

	private static int sumf(int[] fen, int id) {
        int summ = 0;
        for (; id >= 0; id = (id & (id + 1)) - 1)
            summ += fen[id];
        return summ;
    }

    private static void addf(int[] fen, int id) {
        for (; id < fen.length; id |= id + 1)
            fen[id]++;
    }

    private static int nextInt() throws IOException {
        return Integer.parseInt(next());
    }
    private static long nextLong() throws IOException {
        return Long.parseLong(next());
    }
    private static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
    private static String next() throws IOException {
        while (st==null || !st.hasMoreTokens())
            st = new StringTokenizer(br.readLine());
        return st.nextToken();
    }
}