#include <bits/stdc++.h>
using namespace std;
//#define int long long
#include "stations.h"
#define fi first
#define se second
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define sp <<' '<<
#define mid (l+r)/2
#define all(x) x.begin(),x.end()
#define carp(a,b) ((a%MOD)*(b%MOD))%MOD
#define topla(a,b) ((a%MOD)+(b%MOD))%MOD
#define pb push_back
#define DEBUG(x) cout<<#x sp x<<endl;
#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<bool> vb;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
const int MAXN=1e3+6;
const int INF=1e9+7;
int timer;
int tin[MAXN], tout[MAXN];
vll adj[MAXN];
vi ans;
void dfs(int nd,int ata,bool f){
if(f) tin[nd]=timer++;
for(auto kom:adj[nd]){
if(kom==ata) continue;
dfs(kom,nd,!f);
}
if(!f) tout[nd]=timer++;
}
vi label(int n, int k, vi u, vi v){
ans.resize(n);
FOR(i,n) adj[i].clear();
FOR(i,n-1){
adj[u[i]].pb(v[i]);
adj[v[i]].pb(u[i]);
}
timer=1;
dfs(0,-1,true);
return ans;
}
int find_next_station(int s, int t, vi c){
//c sortedmış
bool in=true;
for(auto el:c){
if(s>el){
in=false;
break;
}
}
if(in){
//tin i kayıtlı nodesa
int deg=c.back();
c.pop_back();
int once=s;
int cur;
for(auto el:c){
cur=el;
if(once<t and t<=cur){
return el;
}
}
return deg;
}
else{
//tout ı kayıtlı nodesa
int once=s;
int cur;
reverse(all(c));
int deg=c.back();
c.pop_back();
for(auto el:c){
cur=el;
if(cur<=t and t<once){
return el;
}
}
return deg;
}
}
/*signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int t;
cin>>t;
while(t--){
int n,k;
cin>>n>>k;
vi u(n), v(n);
FOR(i,n-1){
cin>>u[i]>>v[i];
}
int q;
cin>>q;
vi z(q),y(q),w(q);
FOR(i,q){
cin>>z[i]>>y[i]>>w[i];
}
}
}*/
