Wizard's Tour

给定一张 $n$ 个点 $m$ 条边的无向图，每条边连接两个顶点，保证无重边自环，$\Huge{不保证连通}$。 你想在这张图上进行若干次旅游，每次旅游可以任选一个点 $x$ 作为起点，再走到一个与 $x$ 直接有边相连的点 $y$，再走到一个与 $y$ 直接有边相连的点 $z$ 并结束本次旅游。 作为一个旅游爱好者，你不希望经过任意一条边超过一次，注意一条边不能即正向走一次又反向走一次，注意点可以经过多次，在满足此条件下，你希望进行尽可能多次的旅游，请计算出最多能进行的旅游次数并输出任意一种方案。

All Berland residents are waiting for an unprecedented tour of wizard in his Blue Helicopter over the cities of Berland! It is well-known that there are $ n $ cities in Berland, some pairs of which are connected by bidirectional roads. Each pair of cities is connected by no more than one road. It is not guaranteed that the road network is connected, i.e. it is possible that you can't reach some city from some other. The tour will contain several episodes. In each of the episodes: - the wizard will disembark at some city $ x $ from the Helicopter; - he will give a performance and show a movie for free at the city $ x $ ; - he will drive to some neighboring city $ y $ using a road; - he will give a performance and show a movie for free at the city $ y $ ; - he will drive to some neighboring to $ y $ city $ z $ ; - he will give a performance and show a movie for free at the city $ z $ ; - he will embark the Helicopter and fly away from the city $ z $ . It is known that the wizard doesn't like to use roads, so he agrees to use each road at most once (regardless of direction). In other words, for road between $ a $ and $ b $ he only can drive once from $ a $ to $ b $ , or drive once from $ b $ to $ a $ , or do not use this road at all. The wizards wants to plan as many episodes as possible without violation the above rules. Help the wizard! Please note that the wizard can visit the same city multiple times, the restriction is on roads only.

The first line contains two integers $ n $ , $ m $ ( $ 1<=n<=2·10^{5} $ , $ 0<=m<=2·10^{5} $ ) — the number of cities and the number of roads in Berland, respectively. The roads description follow, one in each line. Each description is a pair of two integers $ a_{i},b_{i} $ ( $ 1<=a_{i},b_{i}<=n $ , $ a_{i}≠b_{i} $ ), where $ a_{i} $ and $ b_{i} $ are the ids of the cities connected by the $ i $ -th road. It is guaranteed that there are no two roads connecting the same pair of cities. Every road is bidirectional. The cities are numbered from $ 1 $ to $ n $ . It is possible that the road network in Berland is not connected.

In the first line print $ w $ — the maximum possible number of episodes. The next $ w $ lines should contain the episodes in format $ x $ , $ y $ , $ z $ — the three integers denoting the ids of the cities in the order of the wizard's visits.

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

2
1 4 2
4 3 2

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

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