#include using namespace std; typedef long long ll; typedef long double ld; typedef pair ii; typedef vector vi; typedef vector vvi; typedef vector vii; #define x first #define y second #define pb push_back #define eb emplace_back #define rep(i,a,b) for(auto i = (a); i < (b); ++i) #define REP(i,n) rep(i,0,n) #define all(v) begin(v), end(v) #define sz(v) ((int) (v).size()) #define rs resize vector groep; vector getallen; ll n; bool gretig(ll doel, ll g, ll aantal){ ll somklein = 0, ik, nk = 0; for(ll x = 0; nk < aantal;x++){ if(groep[x] == -1){ somklein += getallen[x]; ik = x; nk++; } } if(somklein > doel){ return false; } ll ig = n; ll over = doel; for(ll a =0; a< aantal;a++){ for(ig--; true; ig--){ if(groep[ig] != -1){ continue; } if(somklein + getallen[ig] - getallen[ik] <= over){ break; } } groep[ig] = g; over -= getallen[ig]; somklein -= getallen[ik]; for(ik--; groep[ik] != -1; ik--); } return true; } signed main(){ ll t; cin >> t; for(ll w = 0; w < t; w++){ groep.clear(); getallen.clear(); vector d; cin>>n; vector> get; ll som = 0; ll nu; for(ll x=0; x < 3; x++){ cin>>nu; d.push_back(nu); } for(ll x=0;x>nu; get.push_back(make_pair(nu,x)); som += nu; groep.push_back(-1); } sort(get.begin(),get.end()); vector nummer; for(ll x=0;x