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 JAVA):

Solution:
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

public class Main {
	
	static int mod = 1000000007;
	
	// ------------------------------------------------------- Scanner -------------------------------------------------------------------------------------------
	
	public static class Scanner {
	    BufferedReader br;
	    StringTokenizer st;
	    public Scanner() {
	       br = new BufferedReader(new InputStreamReader(System.in));
	    }
	    String next() {
	        while (st == null || !st.hasMoreElements()) {
	            try {
	                st = new StringTokenizer(br.readLine());
	            } catch (IOException e) {
	                e.printStackTrace();
	            }
	        }
	        return st.nextToken();
	    }
	    int nextInt() {
	        return Integer.parseInt(next());
	    }
	    long nextLong() {
	        return Long.parseLong(next());
	    }
	    double nextDouble() {
	        return Double.parseDouble(next());
	    }
	    String nextLine(){
	        String str = "";
	    try {
	       str = br.readLine();
	    } catch (IOException e) {
	       e.printStackTrace();
	    }
	    return str;
	    }

	}
	
	// ------------------------------------------------------------ Print and Flush -----------------------------------------------------------------------------------
	
	public static void print(int[] arr) {
		for(int i=0 ; i<arr.length ; i++) System.out.print(arr[i]+" ");
		System.out.println();
	}
	
	public static void print(int[][] arr) {
		for(int i=0 ; i<arr.length ; i++) {
			for(int j=0 ; j<arr[0].length ; j++) System.out.print(arr[i][j]+" ");
			System.out.println();
		}
	}
	
	public static void print(int res) {
		System.out.println(res);
	}
	
	public static void print(String res) {
		System.out.println(res);
	}
	
	public static void print(int a , int b) {
		System.out.println(a + " " + b);
	}
	
	public static void print(char[] res) {
		for (int i = 0 ; i < res.length ; i++) 
			System.out.print(res[i]);
		System.out.println();
	}
	
	public static void flush() {
		System.out.flush();
	}
	
	// ---------------------------------------------------------- Is Palindrome --------------------------------------------------------------------------------------
	
	public static boolean isPalindrome(String str) {
		for (int i = 0 ; i < str.length() ; i++) { 
			if (str.charAt(i) != str.charAt(str.length() - i - 1))
				return false;
		}
		return true;
	}
	
	//----------------------------------------------------- Pair ----------------------------------------------------------------------------------------------------
	
	public static class Pair {
		int x;
		int y;
		Pair(int x, int y) {
			this.x = x;
			this.y = y;
		}
		Pair(Pair p) {
			x = p.x;
			y = p.y;
		}
	}
	
	//----------------------------------------------------- Comparator ------------------------------------------------------------------------------------------------
	
	static class cmp implements Comparator<long[]> {
		public int compare(long[] v1 , long[] v2) {
			if (v1[0] > v2[0])
				return 1;
			else if (v1[0] == v2[0] && v1[1] < v2[1]) 
				return 1;
			return -1;
		}
	}
	
	// ------------------------------------------------------- Tries ------------------------------------------------------------------------------------------------
	
	static class Tries {
		char ch = '\u0000';
		int count = 0;
		Tries[] arr = new Tries[26];
		boolean isEnd = false;
		Tries(char ch) {
			this.ch = ch;
		}
		Tries () { }
	}
	static Tries dummy = new Tries(); 
	static int tries_insert(String str) {
		Tries temp = dummy;
		for (int i = 0 ; i < str.length() ; i++) {
			int pos = str.charAt(i) - 'a';
			if (temp.arr[pos] == null) 
				temp.arr[pos] = new Tries(str.charAt(i));
			temp = temp.arr[pos];
		}
		temp.isEnd = true;
		temp.count += 1;
		return temp.count;
	}
	
	// ------------------------------------------------------ Prime Number (seive) -----------------------------------------------------------------------------------
	
	static int len = 10001;
	static int[] prime_number = new int[len];
	static Set<Integer> prime_number_set = new HashSet<>();
	static Set<Long> three_factor_set = new HashSet<>(); 
	static void seive() {
		prime_number[0] = 1;
		prime_number[1] = 1;
		for (int i = 2 ; i < len ; i++) {
			if (prime_number[i] == 0) {
				long val = i;
				prime_number_set.add(i);
				//three_factor_set.add(val * val);
				for (int j = i + i ; j < len ; j+=i) 
					prime_number[j] = 1;
			}
		}
	}
	
	static long[] product = new long[200001];
	static void multiply() {
		product[0] = 1;
		product[1] = 1;
		for (int i = 2 ; i < 200001 ; i++)
			product[i] = (product[i - 1] * i) % mod;
	}
	
	//---------------------------------------------------------perfect square --------------------------------------------------------------
	
	static Set<Integer> perfect_square = new HashSet();
	static void ps(int len) {
		for (int i = 1 ; i <= len ; i++) {
			perfect_square.add(i * i);
		}
	}
	
	
	// ---------------------------------------------------------- Sqrt ---------------------------------------------------------------------------------------------
		
	static long pow(long a , long b) {
		if (b == 0)
			return 1;
		long mid = pow(a , b/2) % mod;
		if (b % 2 == 0) 
			return (mid * mid) % mod;
		return (((mid * mid) % mod) * a) % mod;
	}
	
	static int sumDigit(long num) {
		int res = 0;
		while (num > 0) {
			res += num % 10;
			num = num / 10;
		}
		return res;
	}
	
	
	// ---------------------------------------------------------- Solve --------------------------------------------------------------------------------------------
	
	public static void solve(Scanner s) {
//		PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
		int n = s.nextInt();
//		long m = s.nextLong();
		int k = s.nextInt();
//		int k1 = s.nextInt();
//		int k2 = s.nextInt();
//		int w = s.nextInt();
//		s.nextLine();
//		String s2 = s.nextLine();
//		List<List<Integer>> arr = new ArrayList<>();
//		for (int i = 0 ; i < n ; i++) {
//			arr.add(new ArrayList<>());
//		}
		
//		int[][] dp = new int[m][n];
//		for (int i = 0 ; i < n ; i++) {
//			for (int j = 0 ; j < m ; j++) 
//				arr.add(new Pair(s.nextInt() , i));
//		}
		int[] arr = new int[n];
		for (int i = 0 ; i < n ; i++) 
			arr[i] = s.nextInt();
//		int[][] data=new int[n][2];
//		String[] arr = new String[n];
//		char[][] data = new char[n][n];
//		for (int i = 0 ; i < n ; i++) 
//			arr[i] = s.nextLine();
//		Pair p1 = new Pair(0 , 0);
//		Pair p2 = new Pair(0 , 0);
//		int count = 0;
//		int a = s.nextInt();
//		int b = s.nextInt();
//		String str = s.nextLine();
//		seive();
		int sum = 0;
		for (int i = 0 ; i < n ; i++) 
			sum += arr[i];
		if (sum == k) {
			System.out.println("NO");
		} else {
			System.out.println("YES");
			sum = 0;
			for (int i = 0 ; i < n ; i++) {
				sum += arr[i];
				if (sum == k) {
					System.out.print(arr[i + 1] + " " + arr[i] + " ");
					sum += arr[i + 1];
					i += 1;
				} else 
					System.out.print(arr[i] + " ");
			}
			System.out.println();
		}
		
	}
	public static void main(String[] args) {
		Scanner s = new Scanner();
//	    PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
//	    multiply();
//		int[2000001][][] 
//		seive();
//		ps(101);
//		prime_number_set.add(1);
		int t = s.nextInt();
//	    s.nextLine();
	    while(t-->0) 
	    	solve(s);

	    
//		e(s);
//	    int n      = s.nextInt();        // read input as integer
//	    long k     = s.nextLong();       // read input as long
//	    double d   = s.nextDouble();     // read input as double
//	    String str = s.next();           // read input as String
//	    String str2  = s.nextLine();       // read whole line as String
//	    long result = 3*k;
//	    out.println(result);                    // print via PrintWriter	   
//	    out.close();
	
	}
}