#include "stations.h"
#include <bits/stdc++.h>
#ifndef EVAL
#include "stub.cpp"
#endif
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
vector <vector <int>> graph(1003);
int timer, tin[1003], tout[1003];
void dfs(int v, int p, int type){
if(type) tout[v] = ++timer;
for(auto to : graph[v]){
if(to != p){
dfs(to, v, 1-type);
}
}
if(!type) tout[v] = ++timer;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v){
timer = 0;
for(int i = 0; i < n; i++){
graph[i].clear();
}
vector <int> labels(n);
for(int i = 0; i < sz(u); i++){
graph[u[i]].pb(v[i]);
graph[v[i]].pb(u[i]);
}
dfs(0, 0, 0);
for(int i = 0; i < n; i++){
labels[i] = tout[i];
}
return labels;
}
int find_next_station(int s, int t, vector<int> c){
if(s > c.back()){
if(t < c[0] || s < t) return c[0];
auto it = ub(all(c), t);
return *(--it);
}
else{
if(c.back() < t || t < s) return c.back();
auto it = lb(all(c), t);
return *it;
}
}
