You are given an undirected graph G. G has N vertices and M edges. The vertices are numbered from 1 through N, and the i-th edge (1 ≤ i ≤ M) connects Vertex a_i and b_i. G does not have self-loops and multiple edges.

You can repeatedly perform the operation of adding an edge between two vertices. However, G must not have self-loops or multiple edges as the result. Also, if Vertex 1 and 2 are connected directly or indirectly by edges, your body will be exposed to a voltage of 1000000007 volts. This must also be avoided.

Under these conditions, at most how many edges can you add? Note that Vertex 1 and 2 are never connected directly or indirectly in the beginning.

Constraints

* 2 ≤ N ≤ 10^5
* 0 ≤ M ≤ 10^5
* 1 ≤ a_i < b_i ≤ N
* All pairs (a_i, b_i) are distinct.
* Vertex 1 and 2 in G are not connected directly or indirectly by edges.

Input

Input is given from Standard Input in the following format:


N M
a_1 b_1
:
a_M b_M


Output

Print the maximum number of edges that can be added.

Examples

Input

4 1
1 3


Output

2


Input

2 0


Output

0


Input

9 6
1 4
1 8
2 5
3 6
4 8
5 7


Output

12
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> a;
vector<ll> b;
bool po[(ll)1e5] = {1, 1};
vector<ll> v[(ll)1e5];
void dfs(ll now, bool yo){
	for(ll next : v[now]){
		if(po[next]) continue;
		po[next] = 1;
		(yo ? a : b).push_back(next);
		dfs(next, yo);
	}
}
int main(){
	ll n, m; cin >> n >> m;
	for(ll i = 0; i < m; ++i){
		ll a, b; cin >> a >> b;
		v[--a].push_back(--b);
		v[b].push_back(a);
	}
	a.push_back(0);
	b.push_back(1);
	dfs(0, 1);
	dfs(1, 0);
	bool yo = a.size() >= b.size();
	for(ll i = 0; i < n; ++i){
		if(po[i]) continue;
		(yo ? a : b).push_back(i);
	}
	ll ans = a.size() * (a.size() - 1) / 2 + b.size() * (b.size() - 1) / 2 - m;
	cout << ans << endl;
	return 0;
}