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

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusive
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=long long;
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (200006)
int main() {
	FAST
	ll t;cin>>t;
	while(t--){
		ll n, x;
		cin>>n>>x;
		vector<ll>A(n);
		for(auto&i:A)cin>>i;
		if(accumulate(all(A), 0ll) == x) {
			cout<<"NO\n";
			continue;
		}
		cout<<"YES\n";
		ll sum = 0;
		FOR(i,0,n-1) {
			sum += A[i];
			if(sum == x) {
				swap(A[i], A[i+1]);
				break;
			}
		}
		FOR(i,0,n-1) cout<<A[i]<<' '; cout<<'\n';
	}
}
