#include <bits/stdc++.h>
#define ll long long

using namespace std;

ll t;
ll n,a,b,c;
ll niz[200005];
ll sor[200005];
ll ps[200005];
ll pola;
ll trn;
ll rj[5];
ll trnr;
queue <ll> q[5];
ll uzet[200005];
ll novi[200005];
ll novin;

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin>>t;
    while(t--){
        cin>>n>>a>>b>>c;
        for(int i=0; i<n; i++){
            cin>>sor[i];
            pola+=sor[i];
        }
        sort(sor,sor+n);
        for(int i=1; i<=n; i++){
            niz[i]=sor[i-1];
            ps[i]=ps[i-1]+niz[i];
        }
        pola++;
        pola/=2;
        for(int i=n; i>0; i--){
            if(trn<a && (ps[a-1-trn]+niz[i]+trnr)<pola){
                trn++;
                trnr+=niz[i];
                q[0].push(niz[i]);
                rj[0]+=niz[i];
                uzet[i]=1;
            }
        }
        for(int i=1; i<=(a-trn); i++){
            q[0].push(niz[i]);
            rj[0]+=niz[i];
            uzet[i]=1;
        }
        novin=0;
        for(int i=1; i<=n; i++){
            if(uzet[i]==0){
                sor[novin]=niz[i];
                novin++;
            }
            uzet[i]=0;
        }
        sort(sor,sor+trn);
        for(int i=1; i<=novin; i++){
            novi[i]=sor[i-1];
            ps[i]=ps[i-1]+novi[i];
        }
        trn=0;
        trnr=0;
        for(int i=novin; i>0; i--){
            if(trn<b && (ps[b-1-trn]+novi[i]+trnr)<pola){
                trn++;
                trnr+=novi[i];
                q[1].push(novi[i]);
                uzet[i]=1;
                rj[1]+=novi[i];
            }
        }
        for(int i=1; i<=(b-trn); i++){
            q[1].push(novi[i]);
            uzet[i]=1;
            rj[1]+=novi[i];
        }
        for(int i=1; i<=novin; i++){
            if(uzet[i]==0){
                q[2].push(novi[i]);
                rj[2]+=novi[i];
            }
        }
        if(rj[0]<pola && rj[1]<pola && rj[2]<pola){
            cout<<"YES\n";
            while(q[0].size()>0){
                cout<<q[0].front()<<" ";
                q[0].pop();
            }
            cout<<"\n";
            while(q[1].size()>0){
                cout<<q[1].front()<<" ";
                q[1].pop();
            }
            cout<<"\n";
            while(q[2].size()>0){
                cout<<q[2].front()<<" ";
                q[2].pop();
            }
            cout<<"\n";
        }
        else{
            cout<<"NO\n";
            while(q[0].size()>0){
                q[0].pop();
            }
            while(q[1].size()>0){
                q[1].pop();
            }
            while(q[2].size()>0){
                q[2].pop();
            }
        }
        for(int i=0; i<=n; i++){
            niz[i]=0;
            ps[i]=0;
            novi[i]=0;
            uzet[i]=0;
            sor[i]=0;
        }
        novin=0;
        trn=0;
        trnr=0;
        pola=0;
        rj[0]=0;
        rj[1]=0;
        rj[2]=0;
    }

    return 0;
}