题目描述

Bytie is playing the computer game Tower Defense. His aim is to construct guard towers, so that they protect all of his domain. There are multiple towns in Bytie's domain, some of which are linked by bidirectional roads. If Bytie erects a guard tower in a city, then the tower protects its city and all the cities directly linked with it by roads.   Just as Bytie was pondering over the placement of guard towers in his domain, his elder sister Bytea entered the room. She glanced at the map displayed on the screen, and after a moment exclaimed: "Oi, what is there to think about, clearly K  towers suffice!".   Angered by his sister spoiling the fun, Bytie showed his sister the door, and began wondering what to do next. Pride will not let him construct more than K  towers. He has an up his sleeve though: he can research a technology that will allow him to constructimproved guard towers. An improved guard tower protects not only the town it was erected in and its immediate neighbors but also the towns that are further away. Formally, an improved guard tower built in the town U protects the town V  if either of the following holds: U=V; there is a direct road from U to V ; or there is such a town W that there are direct roads from U to W and from W to V. Of course, Bytie still strives to erect at most K towers, but he has no qualms about making these the improved guard towers. 有一天XYW在4399上玩一个塔防游戏： 请你给他一种用k座以内加强过的塔保护所有城市的方案 有n座城市由m条双向道路连接。XYW可以在城市中建防御塔，每一座防御塔可以保护它所在的城市以及和这座城市有道路直接连接的城市。 由于XYW比较蠢萌，他建了n座塔保卫了所有城市。 突然XYW的男人看到了他的电脑屏幕：我只要用k座塔就可以了。（保证存在仅用k座塔就可以保卫所有城市的情况） XYW不想被他的男人嘲笑，于是他就开始想如何用k座塔保护所有城市。 由于XYW比较蠢萌，他想不出来。 于是他更改了游戏规则：每一座塔可以保护和它所在城市最短距离在两条道路以内的所有城市。

输入格式

The towns in Bytie's domain are numbered from 1 to N. Next, M lines describing the roads follow. Each of those lines holds two integers, Ai and Bi (1<=Ai,Bi<=N,Ai<>Bi) , indicating that the towns no. Ai and Bi are directly linked by a bidirectional road. Each pair of towns is linked by at most a single road.

输出格式

If more than one solution exists, any solution can be printed. Let us remind that any placement of no more than K improved towers will do - you need not minimize their number. You may assume that Bytea was correct, i.e., that the whole domain of Bytie can indeed be protected by K plain (not improved) guard towers. Thus a solution always exists.

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

3
1 5 7 

提示

2<=n<=500000,0<=m<=1000000

题目来源

鸣谢Jiry_2