Problem:
Score : 500 points

Problem Statement

Rng has a connected undirected graph with N vertices.
Currently, there are M edges in the graph, and the i-th edge connects Vertices A_i and B_i.

Rng will add new edges to the graph by repeating the following operation:

Operation: Choose u and v (u \neq v) such that Vertex v can be reached by traversing exactly three edges from Vertex u, and add an edge connecting Vertices u and v. It is not allowed to add an edge if there is already an edge connecting Vertices u and v.

Find the maximum possible number of edges that can be added.

Constraints

2 \leq N \leq 10^5

1 \leq M \leq 10^5

1 \leq A_i,B_i \leq N

The graph has no self-loops or multiple edges.

The graph is connected.

Input

Input is given from Standard Input in the following format:

N M
A_1 B_1
A_2 B_2
:
A_M B_M

Output

Find the maximum possible number of edges that can be added.

Sample Input 1

6 5
1 2
2 3
3 4
4 5
5 6

Sample Output 1

4

If we add edges as shown below, four edges can be added, and no more.

Sample Input 2

5 5
1 2
2 3
3 1
5 4
5 1

Sample Output 2

5

Five edges can be added, for example, as follows:

Add an edge connecting Vertex 5 and Vertex 3.

Add an edge connecting Vertex 5 and Vertex 2.

Add an edge connecting Vertex 4 and Vertex 1.

Add an edge connecting Vertex 4 and Vertex 2.

Add an edge connecting Vertex 4 and Vertex 3.

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

// Don't place your source in a package
import java.util.*;
import java.lang.*;
import java.io.*;

// Please name your class Main
public class Main {
  int n, m;
  ArrayList<Integer> gr[];
  
  int cnt[] = new int[2];
  int d[];
  
  Main() {
    n = nxtint(); m = nxtint();
    gr = new ArrayList[n + 10];
    for (int i = 0; i ++ < n; ) gr[i] = new ArrayList<>();
    for (int i = -1; ++ i < m; ) {
      int u = nxtint(), v = nxtint();
      gr[u].add(v);
      gr[v].add(u);
    }
    Queue<Integer> qu = new LinkedList<Integer>();
    d = new int[n + 10];
    Arrays.fill(d, -1);
    d[1] = 0;
    for (qu.add(1); qu.size() > 0; ) {
      int u = qu.remove();
      cnt[d[u] & 1]++;
      for (int v: gr[u]) {
        if (d[v] != -1) {
          if ((d[u] + d[v]) % 2 == 0) {
            out.println((long)n * (n - 1) / 2 - m);
            return;
          }
          continue;
        }
        d[v] = d[u] + 1;
        qu.add(v);
      }
    }
    
    long t = 0;
    for (int i = 0; i ++ < n; ) {
      t += cnt[d[i] & 1] - gr[i].size();
    }
    t /= 2;
    t += n - 1 - m;
    out.println(t);
  }
  
  //////////////////////////////////////////////////////////////////////////////////////
  public static void main(String args[]) { new Main().out.flush(); }
  PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out), false);
  PrintStream err = System.err;
  
  BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  StringTokenizer st = null;
  String nxttok() {
    try { while (st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());}
    catch (IOException e) { throw new RuntimeException(e); }
    return st.nextToken();
  }
  int nxtint() { return Integer.parseInt(nxttok()); }
  long nxtlong() { return Long.parseLong(nxttok()); }
  double nxtdouble() { return Double.parseDouble(nxttok()); }
  
}