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

#define rep(i,a,b) for (int i = a; i < b; i++)
#define trav(a,b) for (auto a : b)
#define all(x) begin(x),end(x)
#define lld long long 
pair<lld,int> arr[1000000];
pair<int,int> per[3];
int label[1000000];
lld sum[3];
vector<lld> ans[3];
int n;
void printsol(){
	rep(j,0,3)ans[j].clear();
	rep(i,0,n){
		ans[per[label[i]].second].push_back(arr[i].first);
	}
	cout<<"YES\n";
	rep(j,0,3){
		trav(a,ans[j])cout<<a<<" ";
		cout<<"\n";
	}
	return;
}
void Solve() {
	int na,nb,nc;
	cin>>n>>na>>nb>>nc;
	rep(i,0,n){
		cin>>arr[i].first;
		arr[i].second=i;
	}
	sort(arr,arr+n);
	per[0]={na,0};
	per[1]={nb,1};
	per[2]={nc,2};
	sort(per,per+3);
	reverse(per,per+3);
	int cnt=0;
	rep(i,0,3){
		sum[i]=0;
		rep(j,cnt,cnt+per[i].first){
			sum[i]+=arr[j].first;
			label[j]=i;
		}
		cnt+=per[i].first;
	}
	lld tot=sum[0]+sum[1]+sum[2];
	// cout<<sum[0]<<" "<<sum[1]<<" "<<sum[2]<<endl;
	if(2*sum[0]<tot && 2*sum[1]<tot && 2*sum[2]<tot){
		printsol();
		return;
	}
	if(2*sum[0]>=tot){
		cout<<"NO\n";
		return;
	}
	// cout<<per[0].first<<" "<<per[1].first;
	if(2*sum[1]>=tot){
		rep(j,0,per[1].first){
			sum[0]-=arr[j].first;
			sum[0]+=arr[j+per[0].first].first;
			sum[1]+=arr[j].first;
			sum[1]-=arr[j+per[0].first].first;
			label[j]=1;
			label[j+per[0].first]=0;
			//cout<<sum[0]<<" "<<sum[1]<<" "<<sum[2]<<endl;
			if(2*sum[1]<tot){
				assert(2*sum[0]<tot);
				printsol();
				return;
			}
		}
		assert(false);
		return;
	}
	// cout<<"A"<<endl;
	cnt=0;
	rep(i,0,3){
		sum[(i+2)%3]=0;
		int t=per[(i+2)%3].first-(i==0);
		rep(j,cnt,cnt+t){
			sum[(i+2)%3]+=arr[j].first;
			label[j]=(i+2)%3;
		}
		cnt+=t;
	}
	sum[2]+=arr[n-1].first;
	label[n-1]=2;
	
	// rep(i,0,n)cout<<label[i]<<" ";
	// cout<<endl;
	// cout<<sum[0]<<" "<<sum[1]<<" "<<sum[2]<<endl;
	if(sum[2]*2>=tot){
		cout<<"NO\n";
		return;
	}
	if(2*sum[0]<tot && 2*sum[1]<tot){
		printsol();
		return;
	}
	if(2*sum[1]>=tot){
		int st=per[2].first-1;
		rep(i,st,st+per[1].first){
			sum[0]-=arr[i].first;
			sum[0]+=arr[i+per[0].first].first;
			sum[1]-=arr[i+per[0].first].first;
			sum[1]+=arr[i].first;
			label[i]=1;
			label[i+per[0].first]=0;
			if(2*sum[1]<tot){
				assert(2*sum[0]<tot);
				printsol();
				return;
			}
		}
		assert(false);
	}
	rep(i,0,per[2].first-1){
		sum[0]-=arr[i+per[0].first].first;
		sum[0]+=arr[i].first;
		sum[2]+=arr[i+per[0].first].first;
		sum[2]-=arr[i].first;
		// cout<<sum[0]<<" "<<sum[1]<<" "<<sum[2]<<endl;
		label[i]=0;
		label[i+per[0].first]=2;
		if(2*sum[0]<tot){
			assert(2*sum[2]<tot);
			printsol();
			return;
		}
	}
	assert(false);
}


signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt = 1;
	cin >> tt;
	while (tt--) Solve();
	return 0;
}