#include "highway.h"
#include <bits/stdc++.h>
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
using namespace std;
using ll = long long;
const ll N = 2e5+5 , inf = 2e9 + 7;
const ll INF = 1e18 , mod = 1e9+7;
int road[N];
void find_pair(int n, vector<int> U, vector<int> V, int A, int B) {
vector<int> w;
for(int i = 0; i < U.size(); i++) w.push_back(0);
vector<int> vec;
ll cost1 = ask(w);
int len = cost1/A;
int l = len , r = n-1;
while(l <= r){
if(l == r){
answer(l-len,l);
return;
}
int md = (l+r) >> 1;
for(int i = 0; i < U.size(); i++) w[i] = 0;
for(int i = 0; i < U.size(); i++){
if(i >= md) w[i] = 1;
else w[i] = 0;
}
int cost = ask(w);
if(cost != cost1){
l = md+1;
} else {
r = md;
}
}
}
