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.util.*;
import java.io.*;
import java.lang.*;
import java.math.BigInteger;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Solution solver = new Solution();
        solver.solve(in, out);
        out.close();
	}

	

	static class Solution
	{
		

		public void solve (InputReader in, PrintWriter out)
		{
			int n, m;
			n = in.nextInt(); m = in.nextInt();
			DisSet ds = new DisSet(n);
			int[] regular = new int[n + 1];
			int loop = 0;
			Arrays.fill(regular, 0);
			for (int i = 0; i < m; ++i)
			{
				int u = in.nextInt();
				int v = in.nextInt();
				if (u != v)
				{
					regular[u]++;
					regular[v]++;
					if (ds.find(u) != ds.find(v))
						ds.update(u, v);
				}
				else
				{
					loop++;
				}
			}
			for (int i = 1; i < n + 1; ++i) if (ds.find(i) != ds.find(1)) {out.println(0); return;}
			int ret = 0;
			for (int i = 1; i < n + 1; ++i)
			{
				if (regular[i] > 1) ret += regular[i] * (regular[i] - 1) / 2;
			}
			if (loop > 0) ret += loop * (m - 1);
			if (loop > 1) ret -= loop * (loop - 1) / 2;
			out.println(ret);
		}

		class DisSet
		{
			public int[] st;
			DisSet (int _n)
			{
				st = new int [_n + 1];
				for (int i = 0; i < _n + 1; ++i) st[i] = i;
			}

			public int find (int x)
			{
				if (x != st[x])
				{
					st[x] = find(st[x]);
					return st[x];
				}
				else return x;
			}

			public void update (int x, int y)
			{
				int fx = find(x);
				int fy = find(y);
				if (fx != fy)
				{
					st[fy] = x;
				}
			}
		}
		
	}


	static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong () {
        	return Long.parseLong(next());
        }

    }

}