#include #include using namespace std; vectorsusedi[100005]; int obhodeni[100005]; bool found = 0; int n; vectorv; int fin=-1, start = -1; int target = -1; void dfs(int x, int step, int last) { // cout<<"curr: "<>n>>m; for(int i=0;i>a>>b; susedi[a].push_back(b); susedi[b].push_back(a); } found =0; dfs(1,1,-1); if(!found) { cout<<"No\n"; return 0; } found = 0; dfs2(fin); /*for(int i=1;i<=n;i++) cout<