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.StringTokenizer;

import javax.swing.text.Position.Bias;


public class B {

	static StringTokenizer st;
	static BufferedReader br;
	static PrintWriter pw;
	static ArrayList<Integer>ages[];
	static int[]tin, fup, p;
	static int timer, bridges;
	static boolean[]used;
	
	public static void main(String[] args) throws IOException {
		br = new BufferedReader(new InputStreamReader(System.in));
		pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		int n = nextInt();
		int m = nextInt();
		ages = new ArrayList[n+1];
		for (int i = 1; i <= n; i++) {
			ages[i] = new ArrayList<Integer>();
		}
		boolean[]interesting = new boolean[n+1];
		boolean[]insekf = new boolean[n+1];
		int begin = 0;
		for (int i = 0; i < m; i++) {
			int v1 = nextInt();
			int v2 = nextInt();
			begin = v1;
			interesting[v1] = interesting[v2] = true;
			ages[v1].add(v2);
			ages[v2].add(v1);
			if (v1==v2)
				insekf[v1] = true;
		}
		tin = new int[n+1];
		fup = new int[n+1];
		p = new int[n+1];
		used = new boolean[n+1];
		dfs(begin);
		for (int i = 1; i <= n; i++) {
			if (interesting[i] && !used[i]) {
				System.out.println(0);
				return;
			}
		}
		long notBridges = m - bridges;
		long ans = notBridges * (notBridges-1) / 2;
		for (int i = 1; i <= n; i++) {
			if (insekf[i] && ages[i].size()==2)
				ans++;
		}
		System.out.println(ans);
		pw.close();
	}
	private static void dfs(int v) {
		used[v] = true;
		tin[v] = fup[v] = timer++;
		for (int to : ages[v]) {
			if (to==p[v])
				continue;
			if (!used[to]) {
				p[to] = v;
				dfs(to);
				fup[v] = Math.min(fup[v], fup[to]);
				if (tin[v] < fup[to]) {
					if (ages[v].size() > 1 && ages[to].size() > 1)
						bridges++;
				}
			}
			else
				fup[v] = Math.min(fup[v], tin[to]);
		}
	}
	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();
	}
}