#include <bits/stdc++.h>
#include "light.h"
// #include "sample_grader.cpp"

using namespace std;

namespace 
{
    long long N = 1;
    vector<long long> v;
}

void prepare() {
    v.push_back(1);
}

vector<long long> get() {
    vector<long long>res=v;
    for (auto &u:res) u=N-u+1;
    reverse(res.begin(),res.end());
    return res;
}

pair<long long, vector<long long>> join(long long p) {
    N += p;
    while (v.back()!=N)
    {
        long long  n=v.back()*2+1;
        if (n>N)
        {
            v.push_back(N);
        } else v.push_back(n);
    }
    assert(v.size()<=150);
    return {p, get()};
}

pair<long long, vector<long long>> leave(long long p) {
    N -= p;
    vector<long long>res;
    long long nw=0;
    while (nw<N)
    {
        long long rl=2*nw+1;
        for (auto u:v)
        {
            if (u-2*p>2*nw+1) break;
            rl=min(2*nw+1,u-p);
        }
        assert(rl>nw);
        res.push_back(rl);
        nw=rl;
    }
    v=res;
    assert(v.size()<=150);
    return {p, get()};
}