codeforces 788B—— Weird journey（图论，组合，欧拉回路变形）详解

Weird journey

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Little boy Igor wants to become a traveller. At first, he decided to visit all the cities of his motherland — Uzhlyandia.

It is widely known that Uzhlyandia has n cities connected with m bidirectional roads. Also, there are no two roads in the country that connect the same pair of cities, but roads starting and ending in the same city can exist. Igor wants to plan his journey beforehand. Boy thinks a path is good if the path goes over m - 2 roads twice, and over the other 2 exactly once. The good path can start and finish in any city of Uzhlyandia.

Now he wants to know how many different good paths are in Uzhlyandia. Two paths are considered different if the sets of roads the paths goes over exactly once differ. Help Igor — calculate the number of good paths.

Input

The first line contains two integers n, m (1 ≤ n, m ≤ 106) — the number of cities and roads in Uzhlyandia, respectively.

Each of the next m lines contains two integers u and v (1 ≤ u, v ≤ n) that mean that there is road between cities u and v.

It is guaranteed that no road will be given in the input twice. That also means that for every city there is no more than one road that connects the city to itself.

Output

Print out the only integer — the number of good paths in Uzhlyandia.

Examples

input

5 4
1 2
1 3
1 4
1 5

output

6

input

5 3
1 2
2 3
4 5

output

0

input

2 2
1 1
1 2

output

1

Note

In first sample test case the good paths are:

• 2 → 1 → 3 → 1 → 4 → 1 → 5,
• 2 → 1 → 3 → 1 → 5 → 1 → 4,
• 2 → 1 → 4 → 1 → 5 → 1 → 3,
• 3 → 1 → 2 → 1 → 4 → 1 → 5,
• 3 → 1 → 2 → 1 → 5 → 1 → 4,
• 4 → 1 → 2 → 1 → 3 → 1 → 5.

There are good paths that are same with displayed above, because the sets of roads they pass over once are same:

• 2 → 1 → 4 → 1 → 3 → 1 → 5,
• 2 → 1 → 5 → 1 → 3 → 1 → 4,
• 2 → 1 → 5 → 1 → 4 → 1 → 3,
• 3 → 1 → 4 → 1 → 2 → 1 → 5,
• 3 → 1 → 5 → 1 → 2 → 1 → 4,
• 4 → 1 → 3 → 1 → 2 → 1 → 5,
• and all the paths in the other direction.

Thus, the answer is 6.

In the second test case, Igor simply can not walk by all the roads.

In the third case, Igor walks once over every road.

给一张图，没有重边，但是可以有自环。

问你在图中有多少条路径满足有两条边经过一遍，其他的边各经过两遍。

首先如果图不连通，则不存在这样的路径。不过有一个特例，就是不联通的是孤点，并且没有自环，你也就不需要经过这条边。

那么图连通呢？

关键在于如何选择两条只经过一次的边。

分两种情况，如果其中有自环，则剩下一条边任选。因为相当于所有度都是偶度（走两边就是把所有点的度乘以2），必然有欧拉回路。

否则这两条边必须共端点，因为如果不共端点，则有四个点变成了奇度点，不可能存在欧拉回路。所以枚举每个点即可。

#define  _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<cstring>
#include<queue>
#include <cstdlib>
#include<map>
#include <set>
#include <queue>
using namespace std;
const int MAXN = 1000010;
long long INF = 0x7fffffffffffffff;

int n,m;
struct edge{
	int v, next;
}e[MAXN<<1];

int head[MAXN];
int tot = 0;
void add(int u, int v) {
	e[tot].v = v;
	e[tot].next = head[u];
	head[u] = tot++;
}
long long d[MAXN];
int vis[MAXN];
void dfs(int u) {
	vis[u] = 1;
	for (int k = head[u]; k != -1; k = e[k].next) {
		int v = e[k].v;
		if (!vis[v])
			dfs(v);
	}
}
int xx[MAXN];
int main()
{
	memset(head, -1, sizeof(head));
	memset(d, 0, sizeof(d));
	memset(vis, 0, sizeof(vis));
	scanf("%d%d", &n, &m);
	long long t = 0;
	for (int i = 0; i < m; i++) {
		int u, v;
		scanf("%d%d", &u, &v);
		add(u, v);
		add(v, u);
		if (u == v) {
			t++;
			xx[u] = 1;
			continue;
		}
		d[u]++;
		d[v]++;
	}
	for (int i = 1; i <= n; i++) {
		if (d[i]) {
			dfs(i);
			break;
		}
	}
	for (int i = 1; i <= n; i++) {
		if (!vis[i]) {
			if (xx[i] != 0 || d[i]!=0) {
				puts("0");
				return 0;
			}
		}
	}
	long long s = 0;
	s += t*(t - 1) / 2;
	s += t*(m - t);
	for (int i = 1; i <= n; i++) {
		if (d[i] >= 2) {
			s += d[i] * (d[i] - 1) / 2;
		}
	}
	printf("%I64d\n", s);
}