#include <bits/stdc++.h>
using namespace std;

void solve(){
    int n,na,nb,nc;
    cin>>n>>na>>nb>>nc;
    multiset<int> s[3];
    long long sum[3]={0,0,0};


    set<multiset<long long>> vis;

    for(int i=0;i<n;i++){
        int x;
        cin>>x;
        if(i<na){
            s[0].insert(i);
            sum[0]+=x;
        }else if(i<na+nb){
            s[1].insert(i);
            sum[1]+=x;
        }else{
            s[2].insert(i);
            sum[2]+=x;
        }
    }

    while(max({sum[0],sum[1],sum[2]})>=sum[0]+sum[1]+sum[2]-max({sum[0],sum[1],sum[2]}) && vis.count(multiset<long long>{sum[0],sum[1],sum[2]})){
        vis.insert(multiset<long long>{sum[0],sum[1],sum[2]});

        int big;
        if(sum[0] == max({sum[0],sum[1],sum[2]}))big=0;
        else if(sum[1] == max({sum[0],sum[1],sum[2]}))big=1;
        else big=2;

        int small;
        if(sum[0] == min({sum[0],sum[1],sum[2]}))small=0;
        else if(sum[1] == min({sum[0],sum[1],sum[2]}))small=1;
        else small=2;

        int numb = *(s[big].begin());
        int nums = *(s[small].rbegin());

        sum[small]-=nums;
        sum[big]-=numb;

        sum[small]+=numb;
        sum[big]+=nums;

        s[big].erase(s[big].find(numb));
        s[small].erase(s[small].find(nums));

        s[big].insert(nums);
        s[small].insert(numb);
    }

    if(max({sum[0],sum[1],sum[2]})<sum[0]+sum[1]+sum[2]-max({sum[0],sum[1],sum[2]})){
        cout<<"YES\n";
        for(auto i : s[0])cout<<i<<" ";
        cout<<"\n";
        for(auto i : s[1])cout<<i<<" ";
        cout<<"\n";
        for(auto i : s[2])cout<<i<<" ";
        cout<<"\n";
        return;
    }


    cout<<"NO\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int T = 1;
    cin >> T;

    for (int i = 1; i <= T; i++) {
        solve();
    }

    return 0;
}