// #include "stations.h"
#include <bits/stdc++.h>
#define ll long long
#define co cout<<
using namespace std;
//stuff
const ll maxn=1005;
ll en[maxn],ou[maxn],a[maxn]={};
vector<ll>v1[maxn];
map<ll,ll>mp;
ll tim=1;
void dfs(ll x,ll last,ll dep){
en[x]=tim;
tim++;
for(auto i:v1[x]){
if(i!=last) dfs(i,x,dep+1);
}
ou[x]=tim;
tim++;
if(dep%2) mp[ou[x]],a[x]=ou[x];
else mp[en[x]],a[x]=en[x];
}
vector<int>label(int n, int k, vector<int> u, vector<int> v){
for(int i=0;i<u.size();i++){
v1[u[i]].push_back(v[i]);
v1[v[i]].push_back(u[i]);
}
dfs(0,0,0);
ll cnt=0;
for(auto &i:mp) i.second=cnt,cnt++;
vector<int>labels;
for(int i=0;i<n;i++) labels.push_back(mp[a[i]]);
map<ll,ll>XD;
mp=XD;
for(int i=0;i<n;i++) ou[i]=en[i]=a[i]=0,v1[i].clear();
tim=1;
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
set<ll>s1;
for(auto i:c) s1.insert(i);
ll parent;
ll l,r;
if(s==0){
vector<int>v;
for(auto i:s1) v.push_back(i);
sort(v.begin(),v.end());
for(int i=0;i<v.size()-1;i++){
if(v[i]>=t) return v[i];
}
return v.back();
}
else if(s<=*s1.begin()){
auto it=s1.end();
it--;
parent=*it;
s1.erase(it);
if(s1.size()==0) return parent;
it=s1.end();
it--;
l=s;
r=*it;
// co "wow\n";
if(!(l<=t&&t<=r)) return parent;
vector<int>v;
for(auto i:s1) v.push_back(i);
// odd they have the finishing i have the starting
// co "at least here\n";
sort(v.begin(),v.end());
for(int i=0;i<v.size()-1;i++){
if(v[i]<=t&&t<v[i+1]) return v[i];
}
return v.back();
}
else{
parent=*s1.begin();
s1.erase(s1.begin());
if(s1.size()==0) return parent;
l=*s1.begin();
r=s;
if(!(l<=t&&t<=r)) return parent;
// even i'm the ending time
// they have the starting
vector<int>v;
for(auto i:s1) v.push_back(i);
sort(v.begin(),v.end());
for(int i=0;i<v.size()-1;i++){
if(v[i]<=t&&t<v[i+1]) return v[i];
}
return v.back();
}
return c[0];
}
int main(){
co find_next_station(1,3,{5,2,3});
// co find_next_station(4,3,{2,1});
// vector<int>smth=label(5,1000,{0,1,2,3},{1,2,3,4});
// for(int i=0;i<smth.size();i++){
// co i<<' '<<smth[i]<<'\n';
// }
}
