#include <bits/stdc++.h>
using namespace std ;
#define mid (l+r)/2
#define pb push_back
#define fi first
#define se second
#define C continue
typedef long long ll ;
typedef pair < int , int > pi ;
typedef vector < int > vi ;
typedef vector < ll > vll ;
typedef vector < pi > vpi ;
#include "highway.h"
ll n , m , len , XXX , num ;
vpi v [100009] ;
vi no ;
ll yes [100009] ;
ll query ( vi ret ) {
num ++ ;
if ( num > 60 ) {
cout << 5 / 0 << endl ;
}
vi v ( m , 0 ) ;
for ( auto u : ret ) v [u] = 1 ;
return ask (v) ;
}
void fill ( int node , int p , int lev ) {
yes [node] = ( lev == len ) ;
for ( auto u : v [node] ) {
if ( u .fi == p ) C ;
fill ( u .fi , node , lev + 1 ) ;
yes [node] = max ( yes [node] , yes [u.fi] ) ;
}
}
void dfs ( int node , int p , int lev ) {
if ( lev == len ) {
answer ( 0 , node ) ;
return ;
}
vpi ret ;
for ( auto u : v [node] ) {
if ( u .fi == p ) C ;
if ( !yes [u.fi] ) C ;
ret .pb ( u ) ;
}
if ( ret .size () == 0 ) {
while ( 1 ) {
}
}
int l = -1 , r = ret .size () - 1 ;
while ( r - l > 1 ) {
vi crnt ;
for ( int i = mid + 1 ; i <= r ; i ++ ) {
crnt .pb ( ret [i] .se ) ;
}
int cost = query ( crnt ) ;
if ( cost == len * XXX ) {
r = mid ;
}
else {
l = mid ;
}
}
dfs ( ret [r].fi , node , lev + 1 ) ;
}
void find_pair ( int N , vi U, vi V , int A , int B ) {
n = N , m = U .size () , len = query ( no ) / A , XXX = A ;
for ( int i = 0 ; i < m ; i ++ ) {
int a = U [i] , b = V [i] ;
v [a] .pb ( { b , i } ) ;
v [b] .pb ( { a , i } ) ;
}
fill ( 0 , 0 , 0 ) ;
dfs ( 0 , 0 , 0 ) ;
}
