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.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;



public class Abood2B {
	
	static int n;
	static ArrayList<Integer>[] adjList;
	static boolean[] V;
	static int bfs() {
		V[0] = true;
		
		int ans = 1;
		Queue<Integer> q = new LinkedList<>();
		
		q.add(0);
		
		while(!q.isEmpty()) {
			int u = q.remove();
			for (int i = 0; i < adjList[u].size(); i++) {
				int v = adjList[u].get(i);
				if(V[v])
					continue;
				
				ans ++;
				V[v] = true;
				q.add(v);
			}
		}
		
		return ans;
	}

	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);

		int n = sc.nextInt();
		int m = sc.nextInt();
		
		adjList = new ArrayList[n];
		
		for (int i = 0; i < n; i++)
			adjList[i] = new ArrayList<>();
		
		int[] d = new int[n];
		V = new boolean[n];
		boolean self[] = new boolean[n];
		
		for (int i = 0; i < m; i++) {
			int f = sc.nextInt() - 1;
			int t = sc.nextInt() - 1;
			
			if(f == t) {
				self[f] = true;
			} else {
				d[f]++;
				d[t]++;
				adjList[f].add(t);
				adjList[t].add(f);
			}
			
		}
		
		if(bfs() != n) {
			System.out.println(0);
			
		}else {
			long ans = 0;
			long ansS = 0;
			
			for (int i = 0; i < n; i++) {
				if(self[i])
					ansS += d[i];
				int c = 0;				
				for (int j = 0; j < adjList[i].size(); j++) {
						ans += d[adjList[i].get(j)] - 1;
				}
			}
			
			ans /= 2;
			
			
		
			out.println(ans + ansS);
		}
		
		out.flush();
		out.close();
	}






	static class Scanner 



	{
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(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
		{
			String x = next();
			StringBuilder sb = new StringBuilder("0");
			double res = 0, f = 1;
			boolean dec = false, neg = false;
			int start = 0;
			if(x.charAt(0) == '-')
			{
				neg = true;
				start++;
			}
			for(int i = start; i < x.length(); i++)
				if(x.charAt(i) == '.')
				{
					res = Long.parseLong(sb.toString());
					sb = new StringBuilder("0");
					dec = true;
				}
				else
				{
					sb.append(x.charAt(i));
					if(dec)
						f *= 10;
				}
			res += Long.parseLong(sb.toString()) / f;
			return res * (neg?-1:1);
		}

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



	}

}