#include "bits/stdc++.h"
// #include "grader.cpp"
#include "festival.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;}
const int N = 2e5+5;
const ll INF = 1e15;
ll par[N];
vector<int> a, p, t, A, now;
vector<pii> v;
int sz, last;
int f(ll m){
int l=1, r=sz, ret=0;
while(l<=r){
int mid=(l+r)>>1;
if(par[mid]<=m)
l=mid+1, ret=mid;
else
r=mid-1;
}
return ret;
}
void rec(int x, ll m, int mxt){ // pos, cur money, cur max type
if(mxt==1 or x==(int)a.size()){
int add=f(m);
if((int)A.size()+last<(int)now.size()+add)
A=now, last=add;
return;
}
if(m>=p[a[x]] and mxt>=t[a[x]]){
now.pb(a[x]);
rec(x+1, min(INF, (m-p[a[x]])*t[x]), mxt);
now.pop_back();
}
rec(x+1, m, min(mxt, t[a[x]]-1));
}
vector<int> max_coupons(int m, vector<int> P, vector<int> T){
p=P, t=T;
int n=(int)t.size();
for(int i = 0; i < n; ++i){
if(t[i]>1)
a.pb(i);
else
v.pb({p[i], i});
}
sort(all(v));
sz=(int)v.size();
for(int i = 1; i <= sz; ++i)
par[i]=par[i-1]+v[i-1].ff;
auto cmp=[&](int x, int y) -> bool {
if(t[x]==t[y])
return p[x]<p[y];
return p[x]*1ll*t[x]*(t[y]-1)<p[y]*1ll*t[y]*(t[x]-1);
};
sort(all(a), cmp);
vector<int> ans;
ll M=m;
tr(it, a){
if((M-p[*it])*t[*it]<M)
break;
M=(M-p[*it])*t[*it];
umin(M, INF);
ans.pb(*it);
}
vector<int> cp;
for(int i = (int)ans.size(); i < n-sz; ++i)
cp.pb(a[i]);
a=cp;
cp.clear();
rec(0, M, 4);
tr(it, A)
ans.pb(*it);
for(int i = 0; i < last; ++i)
ans.pb(v[i].ss);
return ans;
}
