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.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
import java.util.StringTokenizer;


public class ELR {

	static class Edge {
		int u,v;
		public Edge(int u,int v) {
			this.u = u;
			this.v = v;
		}
	}

	static ArrayList<Integer> g[];
	static boolean vis[];
	static int comps = 0;
	public static void dfs(int u) {
		if (vis[u]) {
			return;
		}
		++comps;
		vis[u] = true;
		for (Integer v : g[u]) {
			if (!vis[v])
				dfs(v);
		}
	}
	public static void main(String[] args) {new Thread(null, new Runnable() { public void run() {try {
		solve();
	} catch (Throwable e) {

		e.printStackTrace();
	}}}, "2",1<<25).start();}

	public static void solve() throws Throwable {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt(),m = sc.nextInt();
		Edge edges[] = new Edge[m];
		g = new ArrayList[n];
		for (int i = 0 ; i < n ; ++i) {
			g[i] = new ArrayList();
		}
		vis = new boolean[n];
		int d[] = new int[n];
		int cyc = 0;
		boolean f[] = new boolean[n];
		for (int i = 0 ; i < m ; ++i) {
			int u = sc.nextInt() - 1, v = sc.nextInt() - 1;
			g[u].add(v);
			g[v].add(u);
			edges[i] = new Edge(u,v);
			if (u == v) {
				f[u] = true;
				++cyc;
				continue;

			}
			++d[u];
			++d[v];


		}

		dfs(0);
		if (comps != n) {
			System.out.println("0");
		} else {
			long ways = 0;
			for (Edge e : edges) {
				int u = e.u, v = e.v;
				if (u == v) {
					continue;
				}
				ways += 1L*d[u] - 1;
				ways += 1L*d[v] - 1;
			}
			ways /= 2;
			for (int i = 0 ; i < n ; ++i) {
				if (f[i]) {
					ways += 1L*m - 1;
				}
			}

			ways -= 1L*(cyc) * (cyc - 1) / 2;
			System.out.println(ways);
		}
	}

	static class Scanner {
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s) {
			br = new BufferedReader(new InputStreamReader(s));
		}

		public Scanner(String s) throws FileNotFoundException {
			br = new BufferedReader(new FileReader(new File(s)));
		}

		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

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

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

		public String nextLine() throws IOException {
			return br.readLine();
		}

		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}

		public boolean ready() throws IOException {
			return br.ready();
		}
	}
}



