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

#define tsolve int t; cin >> t; while (t--) solve
#define all(x) ::begin(x), ::end(x)
#define sz(x) (ll)::size(x)

using ll = long long;
using ld = long double;

void solve() {
    int n, na, nb, nc;
    cin >> n >> na >> nb >> nc;

    vector<ll> a(n);
    for (ll& e : a) cin >> e;
    ll tot = accumulate(all(a), 0LL);
    sort(all(a), greater<>());

    vector<ll> pref(n+1);
    for (int i=0; i<n; i++) pref[i+1] = pref[i] + a[i];
    auto psum = [&](ll i, ll j) {
        return pref[j] - pref[i];
    };

    int b[3] = {na, nb, nc};
    sort(all(b));

    vector<vector<ll>> ans(3);
    vector<bool> used(n);

    int l;
    bool flag = false;
    
    ll sma = a[0] + psum(n-b[0]+1, n);
    ll rest = pref[n] - sma;
    if (sma * 2 >= tot) goto NO;

    for (l=1; l<=1+b[1]; l++) {
        ll idk = psum(l, l+b[1]);
        if (idk*2 < tot && (rest-idk)*2 < tot) {
            flag = true;
            break;
        }
    }

    if (flag) {
        ans[0].push_back(a[0]);
        used[0] = true;
        for (int i=1; i<b[0]; i++) ans[0].push_back(a[n-i]), used[n-i] = true;
        for (int i=0; i<b[2]; i++) ans[2].push_back(a[l+i]), used[l+i] = true;
        for (int i=0; i<n; i++) if (!used[i]) ans[1].push_back(a[i]);
        goto YES;
    }

    rest = pref[n] - psum(1, 1+b[1]);
    
    for (l=1; l<=b[2]; l++) {
        sma = a[0] + psum(n-l-b[0]+1, n-l);
        ll smc = rest - sma;
        if (sma*2 < tot && smc*2 < tot) {
            flag = true;
            break;
        }
    }
    
    if (flag) {
        ans[0].push_back(a[0]);
        used[0] = true;
        for (int i=1; i<b[0]; i++) {
            int ind = n-l-b[0]+i;
            ans[0].push_back(a[ind]), used[ind] = true;
        }
        for (int i=0; i<n; i++) if (!used[i]) {
            if (b[1] > 0) ans[1].push_back(a[i]), b[1]--;
            else ans[2].push_back(a[i]);
        }
        goto YES;
    }
    goto NO;

YES:
    cout << "YES\n";
    for (auto s : {na, nb, nc}) {
        for (auto& e : ans) if (ssize(e) == s) {
            for (ll x : e) cout << x << ' ';
            cout << '\n';
            e.clear();
            break;
        }
    }
    return;

NO:
    cout << "NO\n";
    return;
}

int main() {
    cin.tie(0)->sync_with_stdio(false);
    cout << setprecision(16);
    tsolve();
}