//#pragma GCC optimize("Ofast,unroll-loops")
#include "souvenirs.h"
#include <bits/stdc++.h>
//#define int long long
#define ll long long
#define ull unsigned long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task2 "top1tst"
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1ll<<k)
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
#define getchar_unlocked getchar
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
using i128 = __int128;
int rand(int l,int r)
{
return uniform_int_distribution<int>(l,r)(rd);
}
void phongbeo();
const int inf = 1e18;
const int mod2 = 998244353;
const double lim=9;
ll n, m, s1, s2, s4, s3, sf, k, s5, s6, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2,
r2, center;
ll i, s10, s12, k1, k2, k3, s11, w, l, r, dem5, dem6, dem7, dem9, root,q;
ll el = 19;
int cnt[10001],c[10001];
void work(int x)
{
int sum=x;
pair<vector<int>,ll>gv=transaction(x);
for(auto f:gv.first)cnt[f]++;
sum-=gv.second;
while(gv.first.size()>1)
{
if(c[gv.first.back()]!=-1)
{
sum-=c[gv.first.back()];
gv.first.pop_back();
}
else
{
work(sum/gv.first.size());
}
}
x=gv.first.back();
c[x]=sum;
if(c[x+1]==-1&&x!=n)
work(c[x]-1);
}
void buy_souvenirs(int N,ll P0)
{
n=N;
for(int i=1; i<=n; i++)
c[i]=-1;
c[1]=P0;
work(c[1]-1);
for(int i=1;i<=n;i++)
{
for(int j=cnt[i];j<i;j++)
transaction(c[i]);
}
}
