#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define int long long
#define double long double
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define S second
#define F first
#define fall(i,a,n) for(int i=a;i<=n;i++)
#define rfall(i,a,n) for(int i=a;i>=n;i--)
#define pb push_back
#define all(x) x.begin(),x.end()
#define lsb(x) (x & -x)
#define sz(x) (int)x.size()
const int MAXN=3e5+10;
const int MAXL=20;
const int inf=1e17;
const int MOD=998244353;
const int HASHBASE=146527;
const int HASHMOD=1e9+7;
typedef pair<int,int> pii;
typedef tuple<int,int,int> trio;
typedef tuple<int,int,int,int> squad;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int> g[MAXN];
int32_t main(){
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
int P,n; cin>>P>>n;
if(P==1){
fall(i,1,n-1){
int a,b; cin>>a>>b;
g[a].pb(b),g[b].pb(a);
}
int root=0;
vector<int> ord;
fall(i,0,n-1) if(sz(g[i])==1) root=i;
vector<bool> vis(n);
while(true){
ord.pb(root);
vis[root]=1;
bool f=0;
for(auto u:g[root]){
if(vis[u]) continue;
root=u;
f=1;
break;
}
if(!f) break;
}
ord.pop_back();
cout<<(ord[0]>ord[1])<<endl;
for(auto x:ord) cout<<x<<endl;
}
else{
bool z; cin>>z;
int a,b; cin>>a>>b;
if(!z) swap(a,b);
cout<<b<<endl;
fall(i,1,n-2){
int c,d; cin>>c>>d;
if(c!=a) swap(c,d);
cout<<c<<endl;
a=d;
}
}
}
