#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define dbg(x) cout << #x << " " << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define pb push_back
#define ld long double
#define ll long long
void pr(vector<int>& a) {
cerr << "arr" << " ";
for(auto i: a) {
cerr << i << " ";
} cerr << endl;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> labels(n), in(n);
vector<int> adj[n + 1];
for(int i = 0; i < n - 1; i++) {
in[u[i]]++, in[v[i]]++;
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
int start = -1;
vector<int> order;
for(int i = 0; i < n; i++) {
if(in[i] == 1) {
start = i;
break;
}
}
// assert(start != -1);
// dfs(start, -1);
auto bfs = [&](int node)-> void {
queue<pair<int, int>> q;
q.push({node, -1});
while(!q.empty()) {
auto u = q.front();
q.pop();
order.push_back(u.first);
for(auto i: adj[u.first]) {
if(i == u.second) continue;
q.push({i, u.first});
}
}
};
bfs(start);
for (int i = 0; i < n; i++) {
labels[order[i]] = i;
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
if(s < t) {
int maxi = -1;
for(auto i: c) {
maxi = max(maxi, i);
}
return maxi;
} else {
int mini = 10000;
for(auto i: c) {
mini = min(mini, i);
}
return mini;
}
return c[0];
}
