#include "bits/stdc++.h"
// #include "grader.cpp"
#include "souvenirs.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
#define mm make_pair
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
using node=pair<vector<int>, ll>;
void buy_souvenirs(int n, ll p0){
assert(n==3);
ll M=p0-1;
node P=transaction(M);
ll rem=P.ss;
if((int)P.ff.size()==1){
ll p1=M-rem;
P=transaction(p1-1);
P=transaction(p1-1);
return;
}
ll sum=M-rem; // p1+p2
P=transaction(sum/2);
return;
}
