#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
const int MX = 1042;
int lab[MX];
vector<int> adj[MX];
void dfs(int node, int par, int id) {
cout << "cur " << node << '\n';
lab[node] = id;
for (auto& x: adj[node])
if (x != par)
dfs(x, node, id + 1);
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
//cout << "called\n";
vector<int> labels(n);
for (int i = 0; i < n; i++)
adj[i].clear();
for (int i = 0; i + 1 < n; i++) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
int start = 0;
for (int i = 0; i < n; i++)
if ((int)adj[i].size() == 1)
start = i;
//cout << "start is " << start << '\n';
dfs(start, -1, 0);
for (int i = 0; i < n; i++)
labels[i] = lab[i];
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
sort(c.begin(), c.end());
if (s < t)
return c.back();
return c[0];
}
