#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
#define name "code"
#define MAXN 1003
#define pb push_back
#define pf push_front
#define ll long long
#define ii pair<int, int>
#define fs first
#define sc second
#define ill pair<int, ll>
#define lli pair<ll, int>
#define llll pair<ll, ll>
#define all(v) v.begin(),v.end()
#define uni(v) v.erase(unique(all(v)),v.end())
#define bit(n,i) (((n)>>(i))&1)
#define FOR(i,a,b) for (int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for (int i=(a),_b=(b); i>=_b; i--)
#define MASK(i) (1LL<<(i))
const int INF=1e9;
const int MOD=1e9+7;
void add(int &u, int v){
u+=v;
if (u>=MOD) u-=MOD;
}
void sub(int &u, int v){
u-=v;
if (u<0) u+=MOD;
}
void minimize(int &u, int v){
u=min(u,v);
}
void maximize(int &u, int v){
u=max(u,v);
}
long long Rand(long long l, long long r){
ll tmp=0;
FOR(i,1,4) tmp=((tmp<<15)^(((1<<15)-1)&rand()));
return l+tmp%(r-l+1);
}
vector<int> adj[MAXN];
int times=0;
int order[MAXN];
void dfs(int u, int p){
order[u]=++times;
for (int v:adj[u]){
if (v==p) continue;
dfs(v,u);
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v){
FOR(i,0,n-1) adj[i].clear();
times=0;
FOR(i,0,n-2){
adj[u[i]].pb(v[i]);
adj[v[i]].pb(u[i]);
}
dfs(0,-1);
vector<int> kq;
FOR(i,0,n-1) kq.pb(order[i]);
return kq;
}
int find_next_station(int s, int t, vector<int> c){
if (s>t){
return c[0];
}
int kq=-1;
for (int u:c){
if (t>=u) kq=u;
}
return kq;
}
/*
int main()
{
freopen(name".inp","r",stdin);
freopen(name".out","w",stdout);
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n=5,k=10;
vector<int> u={0,1,1,2};
vector<int> v={1,2,3,4};
int s=2,t=0;
vector<int> c={1,4};
label(n,k,u,v);
cout<<find_next_station(s,t,c);
return 0;
}
*/
