Odd Sum Segments

有T组数据 给出一个长度为n的序列，求，不能打乱顺序，将其分成k组，让每一组的和为奇数。 如果不可能做到，输出“NO” 否则，输出“YES”,第二行，输出每块末尾的标号。注意，即使最后一块一定是n你也要输出。

You are given an array $ a $ consisting of $ n $ integers $ a_1, a_2, \dots, a_n $ . You want to split it into exactly $ k $ non-empty non-intersecting subsegments such that each subsegment has odd sum (i. e. 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: - $ [1], [2], [3, 4, 5] $ ; - $ [1], [2, 3], [4, 5] $ ; - $ [1], [2, 3, 4], [5] $ ; - $ [1, 2], [3], [4, 5] $ ; - $ [1, 2], [3, 4], [5] $ ; - $ [1, 2, 3], [4], [5] $ . 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 \le q \le 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 \le k \le n \le 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, \dots, a_n $ ( $ 1 \le a_i \le 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 \le 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 division of the array in the second line. The division can be represented as $ k $ integers $ r_1 $ , $ r_2 $ , ..., $ r_k $ such that $ 1 \le r_1 < r_2 < \dots < r_k = n $ , where $ r_j $ is the right border of the $ j $ -th segment (the index of the last element that belongs to the $ j $ -th segment), so the array is divided into subsegments $ [1; r_1], [r_1 + 1; r_2], [r_2 + 1, r_3], \dots, [r_{k - 1} + 1, n] $ . Note that $ r_k $ is always $ n $ but you should print it anyway.

3
5 3
7 18 3 14 1
5 4
1 2 3 4 5
6 2
1 2 8 4 10 2

YES
1 3 5
NO
NO