#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define SZ(x) (int)(x).size()
#define all(x) begin(x), end(x)
const int n0 = 1003;
int T, d[n0];
vector <int> g[n0], ind;
void dfs(int v, int p) {
if (!d[v]) ind[v] = T++;
for (int to : g[v]) {
if (to == p) continue;
d[to] = d[v] ^ 1;
dfs(to, v);
}
if (d[v]) ind[v] = T++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
T = 0, memset(& d, 0, sizeof(d));
ind = vector <int>(n);
for (int i = 0; i < n; i++) g[i].clear();
for (int i = 0; i < SZ(u); i++)
g[u[i]].pb(v[i]), g[v[i]].pb(u[i]);
dfs(0, 0);
return ind;
}
int find_next_station(int s, int t, vector<int> c) {
for (int i = 0; i < SZ(c) - 1; i++)
if (t >= min(s, c[i]) && t <= max(s, c[i]))
return c[i];
return c.back();
}
