B'You are given an array a consisting of n integers a_1, a_2, ... , a_n . You want to split it into exactly k non-empty non-intersecting subsegments such that each subsegment has odd sum (i. xe2 x80 x89e. for each subsegment, the sum of all elements that belong to this subsegment is odd). It is impossible to rearrange (shuffle) the elements of a given array. Each of the n elements of the array a must belong to exactly one of the k subsegments. Let 's see some examples of dividing the array of length 5 into 3 subsegments (not necessarily with odd sums): [1, 2, 3, 4, 5] is the initial array, then all possible ways to divide it into 3 non-empty non-intersecting subsegments are described below: Of course, it can be impossible to divide the initial array into exactly k subsegments in such a way that each of them will have odd sum of elements. In this case print "NO". Otherwise, print "YES" and any possible division of the array. See the output format for the detailed explanation. You have to answer q independent queries. The first line contains one integer q ( 1 <= q <= 2 cdot 10^5 ) -- the number of queries. Then q queries follow. The first line of the query contains two integers n and k ( 1 <= k <= n <= 2 cdot 10^5 ) -- the number of elements in the array and the number of subsegments, respectively. The second line of the query contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^9 ), where a_i is the i -th element of a . It is guaranteed that the sum of n over all queries does not exceed 2 cdot 10^5 ( sum n <= 2 cdot 10^5 ). For each query, print the answer to it. If it is impossible to divide the initial array into exactly k subsegments in such a way that each of them will have odd sum of elements, print "NO" in the first line. Otherwise, print "YES" in the first line and any possible div'...