#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1000;
int tt, in[N], out[N];
vector<int> adj[N], l;
void dfs(int u, int p){
in[u] = tt++;
for(auto v : adj[u]) if(v != p) dfs(v, u);
out[u] = tt - 1;
l[u] = in[u] * 1000 + out[u];
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
tt = 0;
for(int i = 0;i<n;i++) adj[i].clear(), in[i] = out[i] = 0;
for(int i = 0;i<n - 1;i++){
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
l.resize(n);
dfs(0, -1);
return l;
}
int find_next_station(int s, int e, std::vector<int> c) {
int ins = s / 1000, outs = s % 1000, ine = e / 1000, oute = e % 1000, pa;
for(auto x : c){
int inx = x / 1000, outx = x % 1000;
if(inx <= ins && outs <= outx) pa = x;
else if(inx <= ine && oute <= outx) return x;
}
return pa;
}
