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 Program {

  static BufferedReader in;
  static PrintWriter out;
  static StringTokenizer tok = new StringTokenizer("");

  public static void main(String[] args) throws FileNotFoundException {

    in = new BufferedReader(new InputStreamReader(System.in));
    out = new PrintWriter(System.out);

    solve();
    out.close();
  }

  private static String readString() {
    while (!tok.hasMoreTokens()) {
      try {
        tok = new StringTokenizer(in.readLine());
      } catch (IOException e) {
        e.printStackTrace();
      }
    }
    return tok.nextToken();
  }

  private static int readInt() {
    return Integer.parseInt(readString());
  }

  private static double readDouble() {
    return Double.parseDouble(readString());
  }

  private static long readLong() {
    return Long.parseLong(readString());
  }


  static int graph[][];
  static boolean[] used;


  private static void solve() {
    int n = readInt();
    int m = readInt();
    used = new boolean[n];
    int[] u = new int[m];
    int[] v = new int[m];
    int[] rank = new int[n];
    long countPetli = 0;
    long[] petli = new long[n];
    for (int i = 0; i < m; i++) {
      int from = readInt() - 1;
      int to = readInt() - 1;
      if (from == to) {
        countPetli++;
        petli[from]++;
      } else {
        rank[from]++;
        rank[to]++;
      }
      u[i] = from;
      v[i] = to;
    }
    graph = new int[n][];
    int[] pointers = new int[n];
    for (int i = 0; i < n; i++) {
      graph[i] = new int[rank[i]];
    }
    for (int i = 0; i < m; i++) {
      if (u[i] != v[i]) {
        graph[u[i]][pointers[u[i]]++] = v[i];
        graph[v[i]][pointers[v[i]]++] = u[i];
      }
    }
    int count = 0;
    for (int i = 0; i < n; i++) {
      if (!used[i]) {
        dfs(i);
        if (graph[i].length > 0) {
          count++;
        }
      }
    }
    if (count > 1) {
      out.print(0);
      return;
    }
    long ans = 0;
    for (int i = 0; i < n; i++) {
      ans += (long) graph[i].length * (graph[i].length - 1) / 2;
    }
    ans += countPetli * (countPetli - 1) / 2;
    ans += countPetli * (m - countPetli);
    out.print(ans);


  }

  private static void dfs(int x) {
    used[x] = true;
    for (int to = 0; to < graph[x].length; to++) {
      if (!used[graph[x][to]]) {
        dfs(graph[x][to]);
      }
    }
  }

}
