#include "routers.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include "bits/stdc++.h"
using namespace std;
template<class T> bool umin(T& a, const T b) { if(a > b) { a = b; return 1; } return 0; }
template<class T> bool umax(T& a, const T b) { if(a < b) { a = b; return 1; } return 0; }
const int N = 1e3+5;
int tt[N];
void fun(int l, int r, int a, int b){
if(l >= r || a + 1 >= b) return;
int m = (a + b)>>1;
int t = use_detector(m);
umax(tt[t], m);
if(l < t) fun(l, t-1, a, m);
fun(t, r, m, b);
}
vector<int> find_routers(int l, int n, int q) {
fun(0, n-1, 0, l);
vector<int> res(n, 0);
for(int i=1;i<n;i++) res[i] = res[i-1] + (tt[i-1] - res[i-1]) * 2;
return res;
}
