#include "routers.h"
#include <bits/stdc++.h>
#define us use_detector
#define ll long long
#define se second
#define fi first
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
int n, ma;
int a[1010];
void find(int idx){
int l=a[idx-1]+1, r=ma, mid=0, cnt=-1;
while(l<=r){
mid = md;
int ret = us(mid);
if(ret < idx) cnt = mid, l = mid+1;
else r = mid-1;
}
a[idx] = 2*cnt-a[idx-1];
}
std::vector<int> find_routers(int MA, int N, int q) {
n = N; ma = MA;
for(int i=1; i<=n-1; i++) a[i] = -1;
for(int i=1; i<=n-1; i++){
find(i);
}
vector<int> ans; ans.pb(0);
for(int i=1; i<=n-1; i++){
assert(a[i] != -1);
ans.pb(a[i]);
}
// for(auto in : ans) cout << in << " in\n";
return ans;
}
