Problem: Phoenix has collected n pieces of gold, and he wants to weigh them together so he can feel rich. The i-th piece of gold has weight w_i. All weights are distinct. He will put his n pieces of gold on a weight scale, one piece at a time. 

The scale has an unusual defect: if the total weight on it is exactly x, it will explode. Can he put all n gold pieces onto the scale in some order, without the scale exploding during the process? If so, help him find some possible order. 

Formally, rearrange the array w so that for each i (1 ≤ i ≤ n), ∑_{j = 1}^{i}w_j ≠ x.

Input

The input consists of multiple test cases. The first line contains an integer t (1 ≤ t ≤ 1000) — the number of test cases.

The first line of each test case contains two integers n and x (1 ≤ n ≤ 100; 1 ≤ x ≤ 10^4) — the number of gold pieces that Phoenix has and the weight to avoid, respectively. 

The second line of each test case contains n space-separated integers (1 ≤ w_i ≤ 100) — the weights of the gold pieces. It is guaranteed that the weights are pairwise distinct.

Output

For each test case, if Phoenix cannot place all n pieces without the scale exploding, print NO. Otherwise, print YES followed by the rearranged array w. If there are multiple solutions, print any.

Example

Input


3
3 2
3 2 1
5 3
1 2 3 4 8
1 5
5


Output


YES
3 2 1
YES
8 1 2 3 4
NO

Note

In the first test case, Phoenix puts the gold piece with weight 3 on the scale first, then the piece with weight 2, and finally the piece with weight 1. The total weight on the scale is 3, then 5, then 6. The scale does not explode because the total weight on the scale is never 2.

In the second test case, the total weight on the scale is 8, 9, 11, 14, then 18. It is never 3.

In the third test case, Phoenix must put the gold piece with weight 5 on the scale, and the scale will always explode.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define ll long long int
ll mod=1e9+7;
ll mul(ll a,ll b)
{
    return ((a%mod)*(b%mod))%mod;
}
ll add(ll a,ll b)
{
    return (((a+mod)%mod)+((b+mod)%mod)+mod)%mod;
}
ll sub(ll a,ll b)
{
    return (((a+mod)%mod)-((b+mod)%mod)+mod)%mod;
}
ll po(ll a, ll b)
{
    if(b==0)
    {
        return 1;
    }
    ll t=po(a,b/2);
    if(b%2)
    {
        return mul(t,mul(t,a));
    }
    else
    {
        return mul(t,t);
    }
}
ll fen[100005];
void upd(ll x, ll val)
{
	for(ll i=x;i<100005;i+=(i&(-i)))
	{
		fen[i]+=val;
	}
}
ll ret(ll x)
{
	ll s=0;
	for(ll i=x;i>0;i-=(i&(-i)))
	{
		s+=fen[i];
	}
	return s;
}
int main()
{
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    ll t;
    cin>>t;
    while(t--)
    {
    	ll n,x;
    	cin>>n>>x;
    	ll a[n];
    	for(ll i=0;i<n;i++)
    	{
    		cin>>a[i];
    	}
    	sort(a,a+n);
    	bool f=0;
    	
    	if(a[n-1]>x)
    	{
    		swap(a[n-1],a[0]);
    		f=1;
    	}
    	ll s=0;
    	if(f==0)
	    	for(ll i=0;i<n-1;i++)
	    	{
	    		s+=a[i];
	    		if(s+a[n-1]>x)
	    		{
	    			swap(a[i+1],a[n-1]);
	    			f=1;
	    			break;
	    		}
	    	}
		s+=a[n-1];
	    if(f || s<x)
	    {
	    	cout<<"YES\n";
	    	for(ll i=0;i<n;i++)
	    	{
	    		cout<<a[i]<<" ";
	    	}
	    }
	    else
	    {
	    	cout<<"NO";
	    }
	    cout<<"\n";
    }
    return 0;   
}