#include<bits/stdc++.h>
using namespace std ;
#define maxn 200009
#define ll long long
#define pb push_back
#define fi first
#define se second
#define left id<<1
#define right id<<1|1
#define re exit(0);
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1
#define TIME ( 1.0*clock() / CLOCKS_PER_SEC )
const int mod = 1e9+7 ;
const int INF = 1e9 ;
typedef vector<int> vi ;
typedef pair<int,int> pii ;
typedef vector<pii> vii ;
template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; }
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; }
void add ( int &a , int b )
{
a += b ;
if ( a >= mod ) a -= mod ;
if ( a < 0 ) a += mod ;
}
void rf ()
{
freopen ("bai1.inp","r",stdin) ;
}
mt19937 rng (time(0)) ;
int _pow ( int a , int n )
{
if ( n == 0 ) return 1 ;
int res = _pow (a,n/2) ;
if ( n % 2 ) return 1ll*res*res%mod*a%mod ;
else return 1ll*res*res%mod ;
}
vi label ( int n , int k , vi u , vi v ) ;
int find_next_station ( int s , int t , vi c ) ;
vi adjList [maxn] ;
vi Label ;
int timeDfs ;
void dfs ( int u , int par , int len )
{
if ( !len ) Label [u] = ++ timeDfs ;
for ( auto v : adjList [u] ) if ( v != par ) dfs (v,u,len^1) ;
if ( len ) Label [u] = ++ timeDfs ;
}
void reset ( int n )
{
for ( int i = 0 ; i < n ; i ++ ) adjList [i] . clear () ;
timeDfs = 0 ;
Label . clear () ;
}
vi label ( int n , int k , vi u , vi v )
{
reset (n) ;
for ( int i = 0 ; i < n-1 ; i ++ )
{
adjList [u[i]] . pb (v[i]) ;
adjList [v[i]] . pb (u[i]) ;
}
Label.resize (n) ;
dfs (0,0,0) ;
return Label ;
}
int find_next_station ( int s , int t , vi c )
{
if ( c [0] < s )
{
if ( s < t || t < c [0] ) return c [0] ;
return c[upper_bound(c.begin(),c.end(),t)-c.begin()-1] ;
}
if ( c.back () < t || t < s ) return c.back () ;
return c[lower_bound(c.begin(),c.end(),t)-c.begin()] ;
}
//int main ()
//{
// ios_base::sync_with_stdio(0);
// cin.tie(0);cout.tie(0);
//// rf () ;
//
//}
