#include <bits/stdc++.h>
using namespace std;
int use_detector(int x);
unordered_map < int, int > ans;
int query(int x) {
if (ans.find(x) != ans.end()) return ans[x];
return ans[x] = use_detector(x);
}
int detector(int r, int l, int router) {
int low = r, hi = l;
while (low < hi) {
int m = (low + hi) / 2;
if (query(m) >= router) hi = m;
else low = m + 1;
}
return low;
}
vector < int > find_routers(int l, int n, int q) {
vector < int > p(n);
p[0] = 0;
p[n - 1] = detector(1, l, n - 1);
for (int i = 1; i < n - 1; ++i) {
p[i] = 2 * (detector(p[i - 1], p[n - 1], i) - 1) - p[i - 1];
}
if (n == 1) p[1] = 2 * p[1] - p[0];
else p[n - 1] = 2 * p[n - 1] - p[n - 2];
return p;
}
