#include <bits/stdc++.h>
using namespace std;
//#define int long long
#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=2e5+6;
const int INF=1e9+7;
#include "stations.h"
int timer;
int tin[MAXN], tout[MAXN];
vi adj[MAXN];
void dfs(int nd,int ata){
tin[nd]=timer++;
for(auto kom:adj[nd]){
if(kom==ata) continue;
dfs(kom,nd);
}
tout[nd]=timer++;
}
vi label(int n, int k, vi u, vi v){
vi ans(n);
FOR(i,n){
adj[u[i]].pb(v[i]);
adj[v[i]].pb(u[i]);
}
timer=1;
dfs(1,-1);
FOR(i,n){
ans[i]=tin[i];
ans[i]*=10000;
ans[i]+=tout[i];
}
return ans;
/*vi labels(n);
for (int i = 0; i < n; i++) {
labels[i] = i;
}
return labels;*/
}
pii solve(int x){
return {x/10000,x%10000};
}
bool isata(pii a,pii b){
return (a.fi<b.fi and a.se>b.se);
}
int find_next_station(int s, int t, vi c) {
pii bir=solve(s);
pii iki=solve(t);
if(isata(bir,iki)){
//aşağı in
for(auto el:c){
if(isata(solve(el),iki)){
return el;
}
}
}
else{
//atama çık
for(auto el:c){
if(isata(solve(el),bir)){
return el;
}
}
}
}
/*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];
}
}
}*/
