#include <bits/stdc++.h>

using namespace std;
const int c=200005;
long long n, sum, f, t[c], pref[c];
int kis, koz, nagy;
vector<pair<int, int> > sor;
vector<int> ans[3];
void solve() {
    cin >> n;
    for (int i=0; i<3; i++) {
        int x;
        cin >> x;
        sor.push_back({x, i});
    }
    sort(sor.begin(), sor.end());
    for (int i=0; i<3; i++) {

    }
    kis=sor[0].first, koz=sor[1].first, nagy=sor[2].first;
    for (int i=1; i<=n; i++) {
        cin >> t[i];
    }
    sort(t+1, t+n+1);
    for (int i=1; i<=n; i++) {
        pref[i]=pref[i-1]+t[i];
    }
    sum=pref[n], f=(sum+1)/2;
    if (pref[nagy]>=f || t[n]+pref[kis-1]>=f) {
        cout << "NO\n";
    } else {
        int db=1;
        while (db<kis && pref[kis-db-1]+pref[n]-pref[n-db-1]<f) {
            db++;
        }


        int kezd=kis-db, veg=n-db;


        //cout << "alap " << kis << " " << kezd << " " << veg << "\n";

        int db2=koz;
        while (pref[veg]-pref[veg-db2]+pref[kezd+db2]-pref[kezd]>=f) {
            db2--;
        }

        int kezd2=kezd+db2, veg2=veg-koz+db2;

        for (int i=1; i<=n; i++) {
            if (i<=kezd || veg<i) {
                ans[sor[0].second].push_back(t[i]);
            } else if (i<=kezd2 || veg2<i) {
                ans[sor[1].second].push_back(t[i]);
            } else if (kezd2<i && i<=veg2) {
                ans[sor[2].second].push_back(t[i]);
            }
        }

        //cout << "vege " << kezd << " " << veg << " " << kezd2 << " " << veg2 << "\n";


        cout << "YES\n";
        for (int i=0; i<3; i++) {
            for (auto x:ans[i]) {
                cout << x << " ";
            }
            cout << "\n";
        }


    }
    kis=0, koz=0, nagy=0, sum=0, f=0;
    for (int i=0; i<=n; i++) {
        t[i]=0, pref[i]=0;
    }
    sor.clear();
    for (int i=0; i<3; i++) {
        ans[i].clear();
    }



}
int main()
{
    ios_base::sync_with_stdio(false);
    int w;
    cin >> w;
    while (w--) {
        solve();
    }
    return 0;
}
/*
1
5
1 2 2
1 1 10 10 10
*/
/*
1
6 2 2 2
1 1 1 1 1 1
*/
/*

4
6 2 2 2
1 1 1 1 1 1
5 3 1 1
1 1 1 1 1
6 2 2 2
1 1 1 1 1 3
8 5 1 2
16 1 1 1 1 1 1 12





*/