#include "stations.h"
#include "bits/stdc++.h"
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, s, n) for(ll i = ll(s); i < ll(n); i++)
#define rrep(i, n) for(ll i = ll(n)-1; i >= 0; i--)
#define pb push_back
#define eb emplace_back
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vs = vector<string>;
template<class T>
bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T>
bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
vi label(int n, int k, vi u, vi v) {
vi res(n);
iota(all(res), 0);
return res;
}
bool in(int i, int j) {
int s = i, t = i;
while (s <= j) {
if (j <= t) return true;
s = 2 * s + 1;
t = 2 * t + 2;
}
return false;
}
int find_next_station(int s, int t, vi c) {
for (int i : c) {
if (i < s) continue;
if (in(i, t)) return i;
}
return (s - 1) / 2;
}
