CF1196B.Odd Sum Segments

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.

给你一个由 $n$ 个整数 $a_1, a_2, \dots, a_n$ 组成的数组 $a$。你需要将该数组恰好划分为 $k$ 个非空、互不相交的子段（subsegment），使得每个子段的元素和均为奇数（即：对每个子段，属于该子段的所有元素之和为奇数）。不允许重新排列（打乱）给定数组中的元素。数组 $a$ 的全部 $n$ 个元素必须且仅能属于这 $k$ 个子段中的某一个。

我们来看一个将长度为 $5$ 的数组划分为 $3$ 个子段（不一定满足奇数和条件）的例子：$[1, 2, 3, 4, 5]$ 是初始数组，所有将其划分为 $3$ 个非空、互不相交子段的可能方式如下所示：

• $[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]$.

当然，有时无法将初始数组恰好划分为 $k$ 个子段，使得每个子段的元素和均为奇数。此时请输出 "NO"。否则，请输出 "YES"，并给出一种可行的划分方案。输出格式详见后文说明。

你需要回答 $q$ 个相互独立的查询。

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$).

第一行包含一个整数 $q$（$1 \le q \le 2 \cdot 10^5$），表示查询次数。随后是 $q$ 组查询。

每组查询的第一行包含两个整数 $n$ 和 $k$（$1 \le k \le n \le 2 \cdot 10^5$），分别表示数组的元素个数和子区间的个数。

每组查询的第二行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$（$1 \le a_i \le 10^9$），其中 $a_i$ 是数组 $a$ 的第 $i$ 个元素。

保证所有查询的 $n$ 值之和不超过 $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 \lt r_2 \lt \dots \lt 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.

对于每个查询，请输出对应答案。如果无法将初始数组恰好划分为 $k$ 个子段，使得每个子段的元素和均为奇数，则在第一行输出 "NO"。否则，在第一行输出 "YES"，并在第二行输出一种可行的数组划分方案。该划分方案可用 $k$ 个整数 $r_1$, $r_2$, ..., $r_k$ 表示，满足 $1 \le r_1 \lt r_2 \lt \dots \lt r_k = n$，其中 $r_j$ 表示第 $j$ 个子段的右边界（即属于第 $j$ 个子段的最后一个元素的下标），从而将数组划分为子段 $[1; r_1]$, $[r_1 + 1; r_2]$, $[r_2 + 1, r_3]$, $\dots$, $[r_{k - 1} + 1, n]$。注意：$r_k$ 恒为 $n$，但你仍需将其输出。