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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.List;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Hieu Le
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int nNodes = in.nextInt();
            int nEdges = in.nextInt();
            boolean[] hasLoop = new boolean[nNodes];
            List<List<Integer>> adj = new ArrayList<>(nNodes);
            for (int i = 0; i < nNodes; ++i) {
                adj.add(new ArrayList<>());
            }

            Edge[] edges = new Edge[nEdges];
            int nLoops = 0;
            for (int i = 0; i < nEdges; ++i) {
                int a = in.nextInt() - 1;
                int b = in.nextInt() - 1;
                edges[i] = new Edge(a, b);
                ;
                adj.get(b).add(a);
                adj.get(a).add(b);
                if (a == b) {
                    hasLoop[a] = true;
                    ++nLoops;
                }
            }

            if (!isConnected(adj)) {
                out.println(0);
                return;
            }

            long res = 0;
            // Either 0 or 2 nodes have odd degrees.
            for (Edge edge : edges) {
                if (edge.start == edge.end) {
                    // Loop. Can connect with everything.
                    res += (nEdges - 1);
                } else {
                    // Not a loop. Can connect with a loop or any edge which shares a vertex.
                    res += nLoops;
                    res += adj.get(edge.start).size() - 1;
                    if (hasLoop[edge.start]) {
                        --res;
                    }
                    res += adj.get(edge.end).size() - 1;
                    if (hasLoop[edge.end]) {
                        --res;
                    }
                }
            }

            out.println(res / 2);
        }

        private boolean isConnected(List<List<Integer>> adj) {
            int nNodes = adj.size();
            boolean[] visited = new boolean[nNodes];
            dfs(0, visited, adj);
            for (int i = 0; i < nNodes; ++i) {
                if (!visited[i]) return false;
            }
            return true;
        }

        private void dfs(int node, boolean[] visited, List<List<Integer>> adj) {
            visited[node] = true;
            for (int next : adj.get(node)) {
                if (!visited[next]) {
                    dfs(next, visited, adj);
                }
            }
        }

        private class Edge {
            int start;
            int end;

            Edge(int start, int end) {
                this.start = start;
                this.end = end;
            }

        }

    }

    static class InputReader {
        private BufferedReader reader;
        private StringTokenizer tokenizer;
        private static final int BUFFER_SIZE = 32768;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(
                    new InputStreamReader(stream), BUFFER_SIZE);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

    }
}

