#include <bits/stdc++.h>
#include "stations.h"
using namespace std;
const int mxN = 1005;
vector<int> adj[mxN];
int first = -1;
bool dfs(int u = 1, int t = -1, int par = -1){
if(u == t) return 1;
for(auto it : adj[u]){
if(it ^ par){
if(dfs(it, t, u)) {
first = it;
return 1;
}
}
}
return 0;
}
int N;
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
std::vector<int> labels(n);
for(int i = 0; i < n + 2; ++i) adj[i].clear();
for (int i = 0; i < n; i++) {
labels[i] = (i + 1) % n;
} N = n;
for(int i = 0; i < (int) u.size(); ++i){
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
dfs(--s, --t, -1);
return (first + 1) % N;
}
