#include<bits/stdc++.h>
using namespace std;
int indg[1001], ans[1001];
vector<int> adj[1001];
int t1 = 0;
void dfs(int n, int pr)
{
ans[n] = t1++;
for(auto i : adj[n])
if(i != pr)
dfs(i, n);
}
vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
vector<int> labels(n);
for(int i = 0; i < n - 1; i++)
{
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
indg[v[i]]++;
indg[u[i]]++;
}
for(int i = 0; i < n; i++)
{
if(indg[i] == 1)
{
dfs(i, -1);
break;
}
}
for (int i = 0; i < n; i++)
{
labels[i] = ans[i];
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c)
{
if(c.size() == 1)
return c[0];
if(s < t)
return max(c[0], c[1]);
else
return min(c[0], c[1]);
}
