#include "highway.h"
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vii> vvii;
typedef vector<vll> vvll;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
#define ffor(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) ffor(i, 0, n)
#define forin(x, a) for (auto &x: a)
#define all(a) a.begin(), a.end()
void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
int M = U.size();
ll dist = ask(vii(M)) / A;
int lo = 0, hi = N - 1 - dist;
while (lo < hi) {
int mid = (lo + hi) / 2;
vii query(M);
query[mid] = 1;
if (ask(query) > dist * A) {
hi = mid;
} else {
lo = mid + 1;
}
}
answer(lo, lo + dist);
}
