#include "festival.h"
#include <bits/stdc++.h>
using namespace std;
#ifndef DEBUG
#define dbg(...)
#endif
// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)
template<typename T> void read(T& x) { cin >> x; }
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second); }
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }
#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")
#define int long long
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;
vector<signed> calc(vector<signed> ans, vector<vector<pair<int, int>>>& vals) {
vector<signed> res;
for (auto& x : ans) res.pb(x);
for (int i=0; i<4; i++) for (auto& [p, id] : vals[i]) res.pb(id);
return res;
}
vector<signed> max_coupons(signed AA, vector<signed> P, vector<signed> T) {
int n=sz(P), A=AA;
vector<vector<pair<int, int>>> vals(4);
for (int i=0; i<sz(P); i++) {
vals[T[i]-1].pb({P[i], i});
}
for (int i=0; i<4; i++) sort(rall(vals[i]));
vector<signed> ans;
while (n--) {
int best=inf, act=0;
vector<int> v;
for (int i=1; i<4; i++) if (!vals[i].empty()) {
v.pb(i);
}
if (v.empty()) v.pb(0);
do {
int sum=0;
for (int i=0; i<sz(v); i++) {
int cur=vals[v[i]].back().fi;
for (int j=i; j<sz(v); j++) {
cur*=(v[j]+1);
}
sum+=cur;
}
if (sum<best) best=sum, act=v[0];
} while (next_permutation(all(v)));
if (sz(v)==1) act=v[0];
// cout << "A: " << A << " act: " << act << " best: " << best << endlfl;
A=(A-vals[act].back().fi)*(act+1);
if (A<0) break;
ans.pb(vals[act].back().se);
vals[act].pop_back();
if (A>=1e12) return calc(ans, vals);
}
return ans;
}
