#include <bits/stdc++.h>
using namespace std;
long long sz = 1;
void prepare() {
sz = 1;
}
pair<long long, vector<long long>> join(long long p) {
sz += p;
pair<long long, vector<long long>> ans;
ans.first = 5*p;
vector<long long> TMP;
for(long long i=1; i<=sz; i*=2) TMP.push_back(i);
if(__builtin_popcount(sz) != 1) TMP.push_back(sz);
for(int i=0; i<TMP.size(); i++) TMP[i] = sz-TMP[i]+1;
sort(TMP.begin(), TMP.end());
ans.second = TMP;
return ans;
}
pair<long long, vector<long long>> leave(long long p) {
sz -= p;
pair<long long, vector<long long>> ans;
ans.first = 5*p;
vector<long long> TMP;
for(long long i=1; i<=sz; i*=2) TMP.push_back(i);
if(__builtin_popcount(sz) != 1) TMP.push_back(sz);
for(int i=0; i<TMP.size(); i++) TMP[i] = sz-TMP[i]+1;
sort(TMP.begin(), TMP.end());
ans.second = TMP;
return ans;
}
