题目地址

　　　　　　　　http://codeforces.com/contest/1196/problem/B

　　　　

 

　　　　

B. Odd Sum Segments

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given an array aa consisting of nn integers a1,a2,…,ana1,a2,…,an. You want to split it into exactly kk 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 nn elements of the array aa must belong to exactly one of the kk subsegments.

Let's see some examples of dividing the array of length 55 into 33 subsegments (not necessarily with odd sums): [1,2,3,4,5][1,2,3,4,5] is the initial array, then all possible ways to divide it into 33 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];
• [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 kk 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 qq independent queries.

Input

The first line contains one integer qq (1≤q≤2⋅1051≤q≤2⋅105) — the number of queries. Then qq queries follow.

The first line of the query contains two integers nn and kk (1≤k≤n≤2⋅1051≤k≤n≤2⋅105) — the number of elements in the array and the number of subsegments, respectively.

The second line of the query contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1091≤ai≤109), where aiai is the ii-th element of aa.

It is guaranteed that the sum of nn over all queries does not exceed 2⋅1052⋅105 (∑n≤2⋅105∑n≤2⋅105).

Output

For each query, print the answer to it. If it is impossible to divide the initial array into exactly kk 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 kk integers r1r1, r2r2, ..., rkrk such that 1≤r1<r2<⋯<rk=n1≤r1<r2<⋯<rk=n, where rjrj is the right border of the jj-th segment (the index of the last element that belongs to the jj-th segment), so the array is divided into subsegments [1;r1],[r1+1;r2],[r2+1,r3],…,[rk−1+1,n][1;r1],[r1+1;r2],[r2+1,r3],…,[rk−1+1,n]. Note that rkrk is always nn but you should print it anyway.

Example

input

Copy

35 37 18 3 14 15 41 2 3 4 56 21 2 8 4 10 2

output

Copy

YES1 3 5NONO 　　　　题意： 给定一个n，m。下一行有n个数。问是否可以分割成m组，使每组的和为奇数。如果可以，打印YES，并且输出分割出来的每组的最右边坐标（可能有多种，打印一组即可）；否则输出“NO”； 　　　　解析： 首先明确一点：偶数+奇数==奇数　　　　奇数+奇数=偶数； 　　　　　　　　所以呢，在给定的一组数中可以忽略偶数的存在，因为偶数与奇数的运算并不能改变结果的奇偶性。首先统计奇数的个数ob。要分成m组，假设每一组1个奇数，则至少需要m个奇数，因为偶数的存在改变不了结局。 　　　　如果奇数个数ob比m还少，肯定分不出来m组。所以要ob>=m; 根据贪心的思想，从前往后分割。在前面，只要for到一个奇数，就算分割到一组，直到还剩最后一组。需要看最后一组奇数个数，ob-(k-1)即为剩余奇数个数 　　　　如果是偶数个，肯定不行因为加起来是偶数，输出“NO”；奇数个的话，输出YES，打印最后一位的坐标，就行了。 　　　

#include
        
         #include
         
          #include
          
           using namespace std;const int maxn=200005;typedef long long ll;ll a[maxn];int main(){            ll t;        cin>>t;        while(t--)        {            ll n,m;            cin>>n>>m;            ll od=0;            for(int i=0;i
           
            >a[i];                    if(a[i]%2!=0)                        od++;　　　　//统计奇数个数                }            if(od>=m&&(od-(m-1))%2!=0)            {                cout<<"YES"<