#include<bits/stdc++.h>
#include "stations.h"
using namespace std;
const int N = 1005;
vector<int> adj[N];
int dtime;
void dfs(int u , vector<int> &R ,int p = -1){
R[u] =1000 * dtime; dtime++;
for(int v : adj[u])if(v ^ p)dfs(v ,R , u);
R[u] += dtime;
}
vector<int> label(int n , int k ,vector<int> u , vector<int> v){
for(int i = 0; i < n; ++i) adj[i].clear();
for(int i = 0; i < n-1; ++i) adj[u[i]].emplace_back(v[i]) , adj[v[i]].emplace_back(u[i]);
vector<int> R(n);
dtime =0;
dfs(0 , R);
return R;
}
int find_next_station(int s , int t , vector<int> c){
reverse(c.begin() , c.end());
for(int x : c){
int in = x / 1000 , out = x % 1000;
if(in <= t && t <= out) return x;
}
return c.back();
}
/*
int main (){
cin >> n;
for(int i =1; i < n; ++i){
int u , v; cin >> u>> v;
adj[u].emplace_back(v); adj[v].emplace_back(u);
}
vector<int> k = label(n , 1 , {3} , {3});
cout << find_next_station(1 , 3 , {3 , 2 ,0}) << endl;
}
*/
//int main (){}
