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.*;
import java.util.*;
public class Main
{
	int n;
	boolean visited[];
	private void solve()throws IOException
	{
		n=nextInt();
		int m=nextInt();
		int degree[]=new int[n+1];
		int loop=0;
		parent=new int[n+1];
		rank=new int[n+1];
		for(int i=1;i<=n;i++)
			parent[i]=i;
		for(int i=1;i<=m;i++)
		{
			int u=nextInt();
			int v=nextInt();
			if(u==v)
			{
				loop++;
				continue;
			}
			union(u,v);
			degree[u]++;
			degree[v]++;
		}
		int root=-1;
		for(int i=1;i<=n;i++)
		{
			if(parent[i]!=i)
			{
				if(root==-1)
					root=parent[i];
				else if(parent[i]!=root)
				{
					out.println(0);
					return;
				}
			}
		}
		if(root==-1)
		{
			out.println(0);
			return;
		}
		long ans=1l*loop*(m-1)-(1l*loop*(loop-1))/2;
		for(int i=1;i<=n;i++)
		{
			ans+=(1l*(degree[i]-1)*degree[i])/2;
		}
		out.println(ans);
	}
	int parent[],rank[];
	int find(int a){
		if(parent[a]==a)
			return a;
		parent[a]=find(parent[a]);
		return parent[a];
	}
	void union(int a,int b){
		a=find(a);
		b=find(b);
		if(a==b)
			return;
		if(rank[a]>rank[b])
			parent[b]=a;
		else if(rank[a]<rank[b])
			parent[a]=b;
		else
		{
			rank[b]++;
			parent[a]=b;
		}
	}

	 
	///////////////////////////////////////////////////////////

	public void run()throws IOException
	{
		br=new BufferedReader(new InputStreamReader(System.in));
		st=null;
		out=new PrintWriter(System.out);

		solve();

		br.close();
		out.close();
	}
	public static void main(String args[])throws IOException{
		new Main().run();
	}
	BufferedReader br;
	StringTokenizer st;
	PrintWriter out;
	String nextToken()throws IOException{
		while(st==null || !st.hasMoreTokens())
		st=new StringTokenizer(br.readLine());
		return st.nextToken();
	}
	String nextLine()throws IOException{
		return br.readLine();
	}
	int nextInt()throws IOException{
		return Integer.parseInt(nextToken());
	}
	long nextLong()throws IOException{
		return Long.parseLong(nextToken());
	}
	double nextDouble()throws IOException{
		return Double.parseDouble(nextToken());
	}
}