//In the name of God
#include<bits/stdc++.h>
#include "stations.h"
using namespace std;
typedef int ll;
typedef pair<ll, ll> pll;
const ll maxn = 1100;
const ll mod = 1e9 + 7;
const ll inf = 1e9;
#define Mp make_pair
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define Sz(x) ll((x).size())
ll t, st[maxn], ft[maxn], h[maxn];
vector<ll> g[maxn];
void dfs(ll v, ll p){
st[v] = t++;
for(ll u : g[v]){
if(u != p){
h[u] = h[v] + 1;
dfs(u, v);
}
}
ft[v] = t++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> labels(n);
for (int i = 0; i < n; i++) {
labels[i] = i;
}
return labels;
}
int find_next_station(int s, int t, vector<int> c){
return c[0];
}
