#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
vvi adj;
vi labels;
int counter = 0;
void dfs(int node, int parent, bool isFirst)
{
if (isFirst)
labels[node] = counter++;
for (int child : adj[node])
{
if (child == parent)
continue;
dfs(child, node, !isFirst);
}
if (!isFirst)
labels[node] = counter++;
}
vi label(int n, int k, vi u, vi v)
{
labels.resize(n);
adj.resize(n);
loop(i, n - 1)
{
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
dfs(0, -1, true);
return labels;
}
int find_next_station(int s, int t, vi c)
{
sort(all(c));
if (c.back() < s)
{
for (int i = c.size() - 1; i >= 0; i--)
{
if (t >= c[i])
return c[i];
}
return c[0];
}
else
{
for (int i = 0; i < c.size(); i++)
{
if (t <= c[i])
return c[i];
}
return c.back();
}
}
//int main()
//{
// label(9, 17, { 1, 2, 3, 4, 5, 6, 7, 8 }, { 0, 1, 0, 3, 3, 3, 6, 6 });
//
// cout << find_next_station(0, 1, { 2, 8 }) << endl;
// cout << find_next_station(8, 1, { 0, 3, 4, 5 }) << endl;
//
// return 0;
//}
