#include "stations.h"
#include <vector>

// Skyqwq
#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

const int N = 1005;

vector<int> g[N];

int dfn[N], out[N], dfncnt, d[N];

void dfs(int u, int fa) {
	if (d[u] & 1)dfn[u] = dfncnt++;
	for (int v: g[u]) {
		if (v == fa) continue;
		d[v] = d[u] + 1;
		dfs(v, u);
	}
	if (d[u] % 2 == 0)out[u] = dfncnt++;
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	for (int i = 0; i < u.size(); i++)
		g[u[i]].pb(v[i]), g[v[i]].pb(u[i]);
	d[0] = 1;
	dfs(0, -1);
	vector<int> ans;
	for (int i = 0; i < n; i++) {
		if (d[i] & 1) ans.pb(dfn[i]);
		else ans.pb(out[i]);
	}
	for (int i = 0; i < n; i++) {
		dfn[i] = out[i] = d[i] = 0;
		g[i].clear();
	}
	dfncnt = 0;
	return ans;
}

int find_next_station(int s, int t, std::vector<int> c) {
	if (c.size() == 1) return c[0];
	sort(c.begin(), c.end());
	if (c.back() > s || s == 0) {
		int L = s, R = c[c.size() - 2];
		if (t < L || t > R) return c.back();
		for (int i = 0; i + 1 < c.size(); i++)
			if (t <= c[i]) return c[i];
	} else {
		int L = c[0] - 1, R = s;
		if (t < L || t > R) return c[0];
		for (int i = c.size() - 1; i > 0; i--)
			if (t >= c[i]) return c[i];
	}
	return c[0];
}