#include "telepathy.h"
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pb push_back
#define mp make_pair
#define lsb(x) (x&(-x))
#define pii pair<int,int>
#define ss second
#define ff first
#define piii pair<int,pii>
#define debu(x) (cerr << #x << " = "<< x << "\n")
#define debu2(x,y) (cerr << #x << " = "<< x << " " << #y << " = " << y << "\n")
#define debu3(x,y,z) (cerr << #x << " = "<< x << " " << #y << " = " << y << " " << #z << " = " << z<< "\n")
#define bitout(x,y) {\
cerr << #x << " : ";\
for (int justforbits = y; justforbits >=0; justforbits--)cout << (((1 << justforbits) & x)>=1);\
cout << "\n";\
}
#define rangeout(j,rangestart,rangeend) {\
cerr << "outputting " << #j<< ":\n";\
for (int forrang = rangestart; forrang <= rangeend; forrang++)cerr << j[forrang] << " ";\
cerr<<"\n";\
}
#define c1 {cerr << "Checkpoint 1! \n\n";cerr.flush();}
#define c2 {cerr << "Checkpoint 2! \n\n";cerr.flush();}
#define c3 {cerr << "Checkpoint 3! \n\n";cerr.flush();}
#define c4 {cerr << "Checkpoint 4! \n\n";cerr.flush();}
void gotoo(int n, int star, vector<int>&ans, vector<vector<int>>& adjlist, int dest)
{
vector<int>dist(n+1,-1);
priority_queue<piii,vector<piii>,greater<piii>>pq;
pq.push(mp(0,mp(star,star)));
while(!pq.empty())
{
int cd,cn,cf;
cd=pq.top().ff;cn=pq.top().ss.ss;cf=pq.top().ss.ff;
pq.pop();
if(dist[cn]!=-1)continue;
dist[cn]=cf;
for(int to:adjlist[cn])
{
if(dist[to]!=-1)continue;
pq.push(mp(cd+1,mp(cn,to)));
}
}
int curr=dest;
while(curr!=star)
{
ans.pb(curr);
curr=dist[curr];
}
ans.pb(star);
reverse(ans.begin(),ans.end());
}
vector<int> Aitana(int N, vector<int> A, vector<int> B, int S, int subtask)
{
int t1,t2,t3,t4;
vector<int>ans,ans1,ans2;
vector<vector<int>>adjlist(N);
for(int a=0;a<A.size();a++)
{
t1=A[a];t2=B[a];
adjlist[t1].pb(t2);
adjlist[t2].pb(t1);
}
vector<int>ends;
for(int i=0;i<N;i++)
{
if(adjlist[i].size()==1)ends.pb(i);
}
for(int i=1;i<=N;i++){ans.pb(S);}
gotoo(N,S,ans1,adjlist,ends[0]);
for(int x:ans1)ans.pb(x);
gotoo(N,ends[0],ans2,adjlist,ends[1]);
for(int x:ans2)ans.pb(x);
while(ans.size()<10*N+1)
{
ans.pb(ends[1]);
}
return ans;
}
vector<int> Bruno(int N, vector<int> C, vector<int> D, int T, int subtask)
{
int t1,t2,t3,t4;
vector<int>ans;
vector<vector<int>>adjlist(N);
for(int a=0;a<C.size();a++)
{
t1=C[a];t2=D[a];
adjlist[t1].pb(t2);
adjlist[t2].pb(t1);
}
vector<int>ends;
for(int i=0;i<N;i++)
{
if(adjlist[i].size()==1)ends.pb(i);
}
gotoo(N,T,ans,adjlist,ends[0]);
while(ans.size()<10*N+1)
{
ans.pb(ends[0]);
}
return ans;
}
