#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
#define all(x) begin(x),end(x)
#define rep(i,a,b) for(int i=a;i<b;++i)
#define sz(x) int(x.size())
void solve() {
    int n; cin >> n;
    vi x(n);
        int ns[3] = {};
    for(auto& i : ns) cin >> i;
    for(auto& i : x) cin >> i;

    
    ll sum=accumulate(all(x),0LL);
    sort(all(x));
    vector<ll> pref(n+1);
    for(int i=0;i<n;++i) pref[i+1]=pref[i]+x[i];
    vvi ans(3);
    ll s[3] = {};
    for(int i=n-1;i>=0;--i) {
        auto v = x[i];
        pair<ll,int> best = {1e18, -1};
        for(int j=0;j<3;++j) if(ns[j]!=ans[j].size()) {
            auto nv = v+s[j];
            int over = ns[j] - ans[j].size()-1;
            if((pref[over]+nv)*2<sum) {
                best =min(best,{s[j],j});
            }
        }
        if(best.second==-1) {
            cout << "NO\n";
            return;
        }
        int j = best.second;
        ans[j].push_back(v);
        s[j]+=v;
    }
    cout << "YES\n";
    for(auto v : ans) {
        for(auto x:v) cout << x << ' ';
        cout << '\n';
    }

}
int main() {
    cin.tie(NULL);
    cin.sync_with_stdio(false);
    int t; cin >> t;
    while(t--) solve();
}