#include "highway.h"
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int64_t(1e9+7)
#define ln '\n'
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;
#define int long long
struct Edge {
int x,y,depth;
};
const int MAXN = 1.3e5+5;
int n,m;
vector<PII> v[MAXN], v1[MAXN], v2[MAXN], tour;
vector<int32_t> w;
vector<Edge> e;
int d[MAXN], ans;
bool intree[MAXN];
// void dfs(int s, int pa, vector<PII> vec[]) {
// FORX(u,vec[s]) {
// if (u.F == pa) continue;
// if (e[u.S].y != u.F) swap(e[u.S].x, e[u.S].y);
// tour.PB(u.S);
// dfs(u.F,s,vec);
// }
// }
int find_edge(int s) {
// tour.clear();
// dfs(s,pa,vec);
// FORX(u,tour) cout << u << " ";
// cout << ln;
int l = 0, r = m-1;
// FOR(i,0,m) cout << intree[i] << " ";
// cout << ln;
while (l < r) {
FOR(i,0,m) w[i] = 0;
int mid = (l+r+1)/2;
FOR(i,mid,r+1) w[i] = 1;
int val = ask(w);
if (val == ans) r = mid-1;
else l = mid;
}
// cout << "s l: " << s << " " << tour[l] << ln;
return l == -1 ? -1 : l;
}
int find_edge1(int s, int idx, vector<PII> vec[]) {
// tour.clear();
// dfs(s,pa,vec);
// FORX(u,tour) cout << u.S << " ";
// cout << ln;
// FOR(i,0,m) cout << intree[i] << " ";
// cout << ln;
int l = -1, r = tour.size()-1;
while (l < r) {
FOR(i,0,m) w[i] = !intree[i];
int mid = (l+r+1)/2;
FOR(i,mid,r+1) w[tour[i].S] = 1;
int val = ask(w);
if (val == ans) r = mid-1;
else l = mid;
}
// cout << "s l: " << s << " " << tour[l] << ln;
return l == -1 ? -1 : tour[l].S;
}
void bfs_tree(int start, int idx, vector<PII> vec[], vector<PII> vec1[]) {
FOR(i,0,n) vec1[i].clear();
FOR(i,0,m) intree[i] = 0;
tour.clear();
queue<int> q;
q.push(start);
vector<int> d(n,INF);
vector<PII> p(n,{-1,-1});
vector<bool> z(n,0);
d[start] = 0LL;
while (!q.empty()) {
int s = q.front();
q.pop();
if (z[s]) continue;
z[s] = 1;
// cout << s << " ";
FORX(u,vec[s]) {
if (d[s]+1 < d[u.F]) {
d[u.F] = d[s]+1LL;
tour.PB({d[u.F],u.S});
if (e[u.S].y != u.F) swap(e[u.S].x, e[u.S].y);
q.push(u.F);
// p[u.F] = {s,u.S};
}
}
}
FORX(u,tour) intree[u.S] = 1;
sort(ALL(tour));
// FOR(i,0,n) cout << p[i].F << " ";
// cout << ln;
// cout << ln;
// FOR(i,0,n) {
// if (p[i].F != -1) {
// vec1[p[i].F].PB({i,p[i].S});
// vec1[i].PB(p[i]);
// intree[p[i].S] = 1;
// }
// }
}
void find_pair(int32_t N, std::vector<int32_t> U, std::vector<int32_t> V, int32_t A, int32_t B) {
n = N; m = U.size();
FOR(i,0,m) {
v[U[i]].PB({V[i],i});
v[V[i]].PB({U[i],i});
e.PB({U[i],V[i],-1LL});
}
// bfs_tree(0,-1,v,v1);
// FOR(i,0,m) cout << intree[i] << " ";
// cout << ln;
FOR(i,0,m) w.PB(0);
ans = ask(w);
int edge = find_edge(0);
// cout << edge << ln;
int xs = e[edge].x;
// cout << "xs ys: " << xs << " " << ys << ln;
// FOR(i,0,n) {
// cout << i << ": ";
// FORX(u,v2[i]) cout << u.F << " ";
// cout << ln;
// }
// return;
bfs_tree(xs,edge,v,v1);
int edge1 = find_edge1(xs,edge,v1);
int32_t s = edge1 == -1 ? xs : e[edge1].y;
bfs_tree(s,edge1,v,v1);
int edge2 = find_edge1(s,edge1,v1);
int32_t t = edge2 == -1 ? s : e[edge2].y;
// cout << "S T: " << s << " " << t << ln;
FOR(i,0,m) w[i] = 0;
int ans1 = ask(w);
if (ans1 < ans) while (true) int abc = 0;
answer(s,t);
}
