there n city Berland some pair city connect road all road bidirectional each road connect different city there road pair city the city number 1 nit know capital city number 1 reach city move roadsThe President Berland plan improve countrys road network the budget repair exactly n1 road the President plan choose set n1 road possible travel capital city n1 choose road d_i number road need travel capital city move n1 choose road d_1 d_2 dot d_n minimize ie minimal possible in word set n1 road preserve connectivity country sum distance city 1 city minimize use n1 choose roadsthe president instruct ministry prepare k possible option choose n1 road condition metWrite program find k possible way choose road repair if few k way program output possible valid way choose road